Остановите войну!
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 23 matches
- 2013
- Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms 2013: 1-11 - Jérémy Barbay:
From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures. Space-Efficient Data Structures, Streams, and Algorithms 2013: 97-111 - Allan Borodin:
Computing (and Life) Is All about Tradeoffs - A Small Sample of Some Computational Tradeoffs. Space-Efficient Data Structures, Streams, and Algorithms 2013: 112-132 - Prosenjit Bose, John Howat, Pat Morin:
A History of Distribution-Sensitive Data Structures. Space-Efficient Data Structures, Streams, and Algorithms 2013: 133-149 - Joan Boyar, Faith Ellen:
Bounds for Scheduling Jobs on Grid Processors. Space-Efficient Data Structures, Streams, and Algorithms 2013: 12-26 - Gerth Stølting Brodal:
A Survey on Priority Queues. Space-Efficient Data Structures, Streams, and Algorithms 2013: 150-163 - Jean Cardinal, Samuel Fiorini:
On Generalized Comparison-Based Sorting Problems. Space-Efficient Data Structures, Streams, and Algorithms 2013: 164-175 - Timothy M. Chan:
Quake Heaps: A Simple Alternative to Fibonacci Heaps. Space-Efficient Data Structures, Streams, and Algorithms 2013: 27-32 - Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Thomas D. Morgan, Ryuhei Uehara:
Variations on Instant Insanity. Space-Efficient Data Structures, Streams, and Algorithms 2013: 33-47 - Stephane Durocher:
A Simple Linear-Space Data Structure for Constant-Time Range Minimum Query. Space-Efficient Data Structures, Streams, and Algorithms 2013: 48-60 - Rudolf Fleischer, Jiajin Yu:
A Survey of the Game "Lights Out!". Space-Efficient Data Structures, Streams, and Algorithms 2013: 176-198 - Roberto Grossi:
Random Access to High-Order Entropy Compressed Text. Space-Efficient Data Structures, Streams, and Algorithms 2013: 199-215 - Meng He:
Succinct and Implicit Data Structures for Computational Geometry. Space-Efficient Data Structures, Streams, and Algorithms 2013: 216-235 - Wing-Kai Hon, Manish Patil, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter:
Indexes for Document Retrieval with Relevance. Space-Efficient Data Structures, Streams, and Algorithms 2013: 351-362 - John Iacono:
In Pursuit of the Dynamic Optimality Conjecture. Space-Efficient Data Structures, Streams, and Algorithms 2013: 236-250 - Shahin Kamali, Alejandro López-Ortiz:
A Survey of Algorithms and Models for List Update. Space-Efficient Data Structures, Streams, and Algorithms 2013: 251-266 - David G. Kirkpatrick:
Closing a Long-Standing Complexity Gap for Selection: V 3(42) = 50. Space-Efficient Data Structures, Streams, and Algorithms 2013: 61-76 - Moshe Lewenstein:
Orthogonal Range Searching for Text Indexing. Space-Efficient Data Structures, Streams, and Algorithms 2013: 267-302 - Qiang Ma, S. Muthukrishnan, Mark Sandler:
Frugal Streaming for Estimating Quantiles. Space-Efficient Data Structures, Streams, and Algorithms 2013: 77-96 - Patrick K. Nicholson, Venkatesh Raman, S. Srinivasa Rao:
A Survey of Data Structures in the Bitprobe Model. Space-Efficient Data Structures, Streams, and Algorithms 2013: 303-318 - Rajeev Raman, S. Srinivasa Rao:
Succinct Representations of Ordinal Trees. Space-Efficient Data Structures, Streams, and Algorithms 2013: 319-332 - Matthew Skala:
Array Range Queries. Space-Efficient Data Structures, Streams, and Algorithms 2013: 333-350 - Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola:
Space-Efficient Data Structures, Streams, and Algorithms - Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday. Lecture Notes in Computer Science 8066, Springer 2013, ISBN 978-3-642-40272-2 [contents]
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-04-27 11: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