![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 2006
- Kazuyuki Amano, Akira Maruoka:
The Monotone Circuit Complexity of Quadratic Boolean Functions. Algorithmica 46(1): 3-14 (2006) - Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. Algorithmica 46(2): 193-221 (2006) - Amitai Armon, Uri Zwick
:
Multicriteria Global Minimum Cuts. Algorithmica 46(1): 15-26 (2006) - Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis. Algorithmica 46(3-4): 249-270 (2006) - Fredrik Bengtsson, Jingsen Chen:
Efficient Algorithms for k Maximum Sums. Algorithmica 46(1): 27-41 (2006) - Nicolas Broutin, Luc Devroye:
Large Deviations for the Weighted Height of an Extended Class of Trees. Algorithmica 46(3-4): 271-297 (2006) - Jin-yi Cai, Osamu Watanabe:
Random Access to Advice Strings and Collapsing Results. Algorithmica 46(1): 43-57 (2006) - Brigitte Chauvin, Michael Drmota:
The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees. Algorithmica 46(3-4): 299-327 (2006) - Qi Cheng
, Ming-Deh A. Huang:
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. Algorithmica 46(1): 59-68 (2006) - Sylvie Corteel, William M. Y. Goh, Pawel Hitczenko
:
A Local Limit Theorem in the Theory of Overpartitions. Algorithmica 46(3-4): 329-343 (2006) - Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc:
Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006) - Celina M. H. de Figueiredo
, Guilherme Dias da Fonseca
, Vinícius G. P. de Sá, Jeremy P. Spinrad:
Algorithms for the Homogeneous Set Sandwich Problem. Algorithmica 46(2): 149-180 (2006) - James Allen Fill, Nevin Kapur, Alois Panholzer:
Destruction of Very Simple Trees. Algorithmica 46(3-4): 345-366 (2006) - Rudolf Fleischer:
Foreword. Algorithmica 46(1): 1 (2006) - Michael Fuchs
, Hsien-Kuei Hwang
, Ralph Neininger:
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. Algorithmica 46(3-4): 367-407 (2006) - Joachim von zur Gathen, Igor E. Shparlinski
:
GCD of Random Linear Combinations. Algorithmica 46(1): 137-148 (2006) - Jennie C. Hansen, Eric Schmutz, Li Sheng:
The Expected Size of the Rule k Dominating Set. Algorithmica 46(3-4): 409-418 (2006) - John Hershberger, Nisheeth Shrivastava, Subhash Suri, Csaba D. Tóth:
Adaptive Spatial Partitioning for Multidimensional Data Streams. Algorithmica 46(1): 97-117 (2006) - Philippe Jacquet, Daniel Panario
, Wojciech Szpankowski:
Preface. Algorithmica 46(3-4): 247-248 (2006) - Svante Janson:
Left and Right Pathlengths in Random Binary Trees. Algorithmica 46(3-4): 419-429 (2006) - Jesper Jansson
, See-Kiong Ng, Wing-Kin Sung
, Hugo Willy
:
A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment. Algorithmica 46(2): 223-245 (2006) - Guy Louchard, Helmut Prodinger:
Asymptotics of the Moments of Extreme-Value Related Distribution Functions. Algorithmica 46(3-4): 431-467 (2006) - Moritz G. Maaß:
Average-Case Analysis of Approximate Trie Search. Algorithmica 46(3-4): 469-491 (2006) - Timo von Oertzen:
Exact Computation of Polynomial Zeros Expressible by Square Roots. Algorithmica 46(1): 119-136 (2006) - Mohamed Omar, Daniel Panario
, L. Bruce Richmond, Jacki Whitely:
Asymptotics of Largest Components in Combinatorial Structures. Algorithmica 46(3-4): 493-503 (2006) - Dominique Poulalhon, Gilles Schaeffer:
Optimal Coding and Sampling of Triangulations. Algorithmica 46(3-4): 505-527 (2006) - Vlady Ravelomanana:
The Average Size of Giant Components between the Double-Jump. Algorithmica 46(3-4): 529-555 (2006) - Gadiel Seroussi:
On the Number of t-Ary Trees with a Given Path Length. Algorithmica 46(3-4): 557-565 (2006) - Uri Zwick:
A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths. Algorithmica 46(2): 181-192 (2006)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-08-15 10:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint