Остановите войну!
for scientists:
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 95 matches
- 2000
- Micah Adler, John W. Byers, Richard M. Karp:
Parallel Sorting with Limited Bandwidth. SIAM J. Comput. 29(6): 1997-2015 (2000) - Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter:
Binary Space Partitions for Fat Rectangles. SIAM J. Comput. 29(5): 1422-1448 (2000) - Alok Aggarwal, Jon M. Kleinberg, David P. Williamson:
Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. SIAM J. Comput. 29(4): 1321-1333 (2000) - Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg:
On Quiescent Reliable Communication. SIAM J. Comput. 29(6): 2040-2073 (2000) - Susanne Albers, Monika Rauch Henzinger:
Exploring Unknown Environments. SIAM J. Comput. 29(4): 1164-1188 (2000) - Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter:
Application-Controlled Paging for a Shared Cache. SIAM J. Comput. 29(4): 1290-1303 (2000) - Michael Benedikt, Leonid Libkin:
Safe Constraint Queries. SIAM J. Comput. 29(5): 1652-1682 (2000) - Avrim Blum, Prasad Chalasani:
An Online Algorithm for Improving Performance in Navigation. SIAM J. Comput. 29(6): 1907-1938 (2000) - Jean-Daniel Boissonnat, Franco P. Preparata:
Robust Plane Sweep for Intersecting Segments. SIAM J. Comput. 29(5): 1401-1421 (2000) - Maria Luisa Bonet, Toniann Pitassi, Ran Raz:
On Interpolation and Automatization for Frege Systems. SIAM J. Comput. 29(6): 1939-1967 (2000) - Ravi B. Boppana, Babu O. Narayanan:
Perfect-Information Leader Election with Optimal Resilience. SIAM J. Comput. 29(4): 1304-1320 (2000) - Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet:
Separating Complexity Classes Using Autoreducibility. SIAM J. Comput. 29(5): 1497-1520 (2000) - Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein:
The Complexity of the A B C Problem. SIAM J. Comput. 29(6): 1878-1888 (2000) - Edward P. F. Chan, Ron van der Meyden:
Containment and Optimization of Object-Preserving Conjunctive Queries. SIAM J. Comput. 29(4): 1371-1400 (2000) - Zhi-Zhong Chen, Ming-Yang Kao:
Reducing Randomness via Irrational Numbers. SIAM J. Comput. 29(4): 1247-1256 (2000) - Danny Z. Chen, Kevin S. Klenk, Hung-Yi Tu:
Shortest Path Queries Among Weighted Obstacles in the Rectilinear Plane. SIAM J. Comput. 29(4): 1223-1246 (2000) - Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann:
Contention Resolution in Hashing Based Shared Memory Simulations. SIAM J. Comput. 29(5): 1703-1739 (2000) - Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross:
An Optimal Algorithm for Monte Carlo Estimation. SIAM J. Comput. 29(5): 1484-1496 (2000) - Dorit Dor, Shay Halperin, Uri Zwick:
All-Pairs Almost Shortest Paths. SIAM J. Comput. 29(5): 1740-1759 (2000) - Funda Ergün, Ravi Kumar, D. Sivakumar:
Self-Testing without the Generator Bottleneck. SIAM J. Comput. 29(5): 1630-1651 (2000) - Jeff Erickson:
Space-Time Tradeoffs for Emptiness Queries. SIAM J. Comput. 29(6): 1968-1996 (2000) - Oren Etzioni, Steve Hanks, Tao Jiang, Omid Madani:
Optimal Information Gathering on the Internet with Time and Cost Constraints. SIAM J. Comput. 29(5): 1596-1620 (2000) - Joachim von zur Gathen, Igor E. Shparlinski:
The CREW PRAM Complexity of Modular Inversion. SIAM J. Comput. 29(6): 1839-1857 (2000) - Oded Goldreich, Shmuel Safra:
A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem. SIAM J. Comput. 29(4): 1132-1154 (2000) - Vince Grolmusz, Gábor Tardos:
Lower Bounds for (MODp-MODm) Circuits. SIAM J. Comput. 29(4): 1209-1222 (2000) - Sariel Har-Peled:
Constructing Planar Cuttings in Theory and Practice. SIAM J. Comput. 29(6): 2016-2039 (2000) - Monika Rauch Henzinger:
Improved Data Structures for Fully Dynamic Biconnectivity. SIAM J. Comput. 29(6): 1761-1815 (2000) - Ming-Yang Kao, Jie Wang:
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors. SIAM J. Comput. 29(5): 1568-1576 (2000) - Sanjiv Kapoor:
Dynamic Maintenance of Maxima of 2-d Point Sets. SIAM J. Comput. 29(6): 1858-1877 (2000) - Sanjeev Khanna, Vincenzo Liberatore:
On Broadcast Disk Paging. SIAM J. Comput. 29(5): 1683-1702 (2000)
skipping 65 more matches
loading more results
failed to load more results, please try again later
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-06-03 17:53 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