![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.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 30 matches
- 2002
- Adnan Agbaria, Yosi Ben-Asher, Ilan Newman:
Communication - Processor Tradeoffs in a Limited Resources PRAM. Algorithmica 34(3): 276-297 (2002) - Matthew Andrews, Lisa Zhang:
Approximation Algorithms for Access Network Design. Algorithmica 34(2): 197-215 (2002) - Yossi Azar
, Joan Boyar
, Lene M. Favrholdt
, Kim S. Larsen
, Morten N. Nielsen, Leah Epstein:
Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196 (2002) - Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani P. Roychowdhury, Farrokh Vatan:
A New Proof for the Existence of Mutually Unbiased Bases. Algorithmica 34(4): 512-528 (2002) - Surender Baswana, Sandeep Sen:
Planar Graph Blocking for External Searching. Algorithmica 34(3): 298-308 (2002) - J. Niel de Beaudrap, Richard Cleve, John Watrous:
Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002) - Olivier Beaumont
, Vincent Boudet, Fabrice Rastello, Yves Robert
:
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms. Algorithmica 34(3): 217-239 (2002) - Paul Benioff:
The Representation of Numbers in Quantum Mechanics. Algorithmica 34(4): 529-559 (2002) - Mark de Berg, A. Frank van der Stappen
, Jules Vleugels, Matthew J. Katz:
Realistic Input Models for Geometric Algorithms. Algorithmica 34(1): 81-97 (2002) - Eli Biham, Michel Boyer, Gilles Brassard, Jeroen van de Graaf, Tal Mor:
Security of Quantum Key Distribution against All Collective Attacks. Algorithmica 34(4): 372-388 (2002) - Jean-Daniel Boissonnat, Subir Kumar Ghosh, Telikepalli Kavitha, Sylvain Lazard:
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon. Algorithmica 34(2): 109-156 (2002) - Todd A. Brun
:
Remotely Prepared Entanglement: a Quantum Web Page. Algorithmica 34(4): 502-511 (2002) - Timothy M. Chan:
A Near-Linear Area Bound for Drawing Binary Trees. Algorithmica 34(1): 1-13 (2002) - Bernard Chazelle, Olivier Devillers
, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002) - Chunhong Chen, Elaheh Bozorgzadeh, Ankur Srivastava
, Majid Sarrafzadeh:
Budget Management with Applications. Algorithmica 34(3): 261-275 (2002) - Wim van Dam:
Quantum Algorithms for Weighing Matrices and Quadratic Residues. Algorithmica 34(4): 413-428 (2002) - Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan:
Testing and Spot-Checking of Data Streams. Algorithmica 34(1): 67-80 (2002) - Peter C. Fishburn, J. C. Lagarias:
Pinwheel Scheduling: Achievable Densities. Algorithmica 34(1): 14-38 (2002) - Gerald Gilbert, Michael Hamrick:
Secrecy, Computational Loads and Rates in Practical Quantum Cryptography. Algorithmica 34(4): 314-339 (2002) - Nicolas Gisin, Renato Renner, Stefan Wolf
:
Linking Classical and Quantum Key Agreement: Is There a Classical Analog to Bound Entanglement? Algorithmica 34(4): 389-412 (2002) - Thomas P. Hayes, Samuel Kutin, Dieter van Melkebeek:
The Quantum Black-Box Complexity of Majority. Algorithmica 34(4): 480-501 (2002) - Peter Høyer
, Jan Neerbek, Yaoyun Shi:
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness. Algorithmica 34(4): 429-448 (2002) - Hitoshi Inamori:
Security of Practical Time-Reversed EPR Quantum Key Distribution. Algorithmica 34(4): 340-365 (2002) - Hitoshi Inamori:
Security of Practical BB84 Quantum Key Distribution. Algorithmica 34(4): 366-371 (2002) - Thomas Jansen, Ingo Wegener:
The Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help. Algorithmica 34(1): 47-66 (2002) - Kazuhisa Makino, Masafumi Yamashita, Tiko Kameda:
Max- and Min-Neighborhood Monopolies. Algorithmica 34(3): 240-260 (2002) - Michele Mosca, Alain Tapp:
Introduction. Algorithmica 34(4): 309-313 (2002) - Nadia Pisanti, Marie-France Sagot:
Further Thoughts on the Syntenic Distance between Genomes. Algorithmica 34(2): 157-180 (2002) - Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh:
The Quantum Complexity of Set Membership. Algorithmica 34(4): 462-479 (2002) - R. Ravi, David P. Williamson:
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica 34(1): 98-107 (2002)
loading more results
failed to load more results, please try again later
![](https://dblp.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-23 21:58 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