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 15 matches
- 2007
- Heiner Ackermann:
A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games. SAGA 2007: 58-69 - Harry Buhrman:
On Computation and Communication with Small Bias. SAGA 2007: 1 - Artur Czumaj, Xin Wang:
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. SAGA 2007: 70-81 - Martin Dietzfelbinger:
Design Strategies for Minimal Perfect Hash Functions. SAGA 2007: 2-17 - Thomas Erlebach, Alexander Hall, Matús Mihalák:
Approximate Discovery of Random Graphs. SAGA 2007: 82-92 - Rusins Freivalds:
Hamming, Permutations and Automata. SAGA 2007: 18-29 - Walter J. Gutjahr, Stefan Katzensteiner, Peter Reiter:
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis. SAGA 2007: 93-104 - Jens Jägersküpper:
Lower Bounds for Hit-and-Run Direct Search. SAGA 2007: 118-129 - David Jao, S. Ramesh Raju, Ramarathnam Venkatesan:
Digit Set Randomization in Elliptic Curve Cryptography. SAGA 2007: 105-117 - Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA 2007: 130-141 - Mustafa Karakoç, Adnan Kavak:
Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks. SAGA 2007: 142-153 - Spyros C. Kontogiannis, Paul G. Spirakis:
Probabilistic Techniques in Algorithmic Game Theory. SAGA 2007: 30-53 - Spyros C. Kontogiannis, Paul G. Spirakis:
On the Support Size of Stable Strategies in Random Games. SAGA 2007: 154-165 - Aravind Srinivasan:
Randomized Algorithms and Probabilistic Analysis in Wireless Networking. SAGA 2007: 54-57 - Juraj Hromkovic, Richard Královic, Marc Nunkesser, Peter Widmayer:
Stochastic Algorithms: Foundations and Applications, 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings. Lecture Notes in Computer Science 4665, Springer 2007, ISBN 978-3-540-74870-0 [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-12-13 05:02 CET 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