Остановите войну!
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 58 matches
- 2004
- Martin Aigner, Gianluca De Marco, Manuela Montangero:
The Plurality Problem with Three Colors. STACS 2004: 513-521 - Eric Allender, Harry Buhrman, Michal Koucký:
What Can be Efficiently Reduced to the K-Random Strings? STACS 2004: 584-595 - Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata. STACS 2004: 93-104 - Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita:
Quantum Identification of Boolean Oracles. STACS 2004: 105-116 - Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri:
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS 2004: 418-427 - Christoph Ambühl, Birgitta Weber:
Parallel Prefetching and Caching Is Hard. STACS 2004: 211-221 - Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo:
Effective Strong Dimension in Algorithmic Information and Computational Complexity. STACS 2004: 632-643 - Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano:
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. STACS 2004: 608-619 - Sebastian Bala:
Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms. STACS 2004: 596-607 - Régis Barbanchon, Etienne Grandjean:
The Minimal Logically-Defined NP-Complete Problem. STACS 2004: 338-349 - Yair Bartal, Francis Y. L. Chin, Marek Chrobak, Stanley P. Y. Fung, Wojciech Jawor, Ron Lavi, Jirí Sgall, Tomás Tichý:
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs. STACS 2004: 187-198 - Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin:
The Syntactic Graph of a Sofic Shift. STACS 2004: 282-293 - Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models. STACS 2004: 117-128 - Elmar Böhler, Edith Hemaspaandra, Steffen Reith, Heribert Vollmer:
The Complexity of Boolean Constraint Isomorphism. STACS 2004: 164-175 - Carlos Brito, Eli Gafni, Shailesh Vaya:
An Information Theoretic Lower Bound for Broadcasting in Radio Networks. STACS 2004: 534-546 - Harry Buhrman, Hartmut Klauck, Nikolai K. Vereshchagin, Paul M. B. Vitányi:
Individual Communication Complexity: Extended Abstract. STACS 2004: 19-30 - Doron Bustan, Orna Kupferman, Moshe Y. Vardi:
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy. STACS 2004: 522-533 - Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. STACS 2004: 571-583 - Ioannis Caragiannis, Christos Kaklamanis:
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks. STACS 2004: 258-269 - Marek Chrobak, Jirí Sgall:
Errata to Analysis of the Harmonic Algorithm for Three Servers. STACS 2004: 656 - David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
Identifying Efficiently Solvable Cases of Max CSP. STACS 2004: 152-163 - Thomas Colcombet, Christof Löding:
On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS 2004: 428-439 - Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert:
Algorithms for SAT Based on Search in Hamming Balls. STACS 2004: 141-151 - Kedar Dhamdhere, Anupam Gupta, R. Ravi:
Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245 - Philippe Duchon, Nicolas Hanusse, Nasser Saheb, Akka Zemmari:
Broadcast in the Rendezvous Model. STACS 2004: 559-570 - Tomás Ebenlendr, Jirí Sgall:
Optimal and Online Preemptive Scheduling on Uniformly Related Machines. STACS 2004: 199-210 - Thomas Erlebach, Riko Jacob, Matús Mihalák, Marc Nunkesser, Gábor Szabó, Peter Widmayer:
An Algorithmic View on OVSF Code Assignment. STACS 2004: 270-281 - Fedor V. Fomin, Dimitrios M. Thilikos:
A Simple and Fast Approach for Solving Problems on Planar Graphs. STACS 2004: 56-67 - Pierre Fraigniaud, David Ilcinkas:
Digraphs Exploration with Little Memory. STACS 2004: 246-257
skipping 28 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 20:19 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