Остановите войну!
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
- 2006
- Manindra Agrawal, Nitin Saxena:
Equivalence of F-Algebras and Cubic Forms. STACS 2006: 115-126 - Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229 - Susanne Albers, Hiroshi Fujiwara:
Energy-Efficient Algorithms for Flow Time Minimization. STACS 2006: 621-633 - Andris Ambainis, Robert Spalek:
Quantum Algorithms for Matching and Network Flows. STACS 2006: 172-183 - Vikraman Arvind, Johannes Köbler:
On Hypergraph and Graph Isomorphism with Bounded Color Classes. STACS 2006: 384-395 - Yossi Azar, Yoel Chaiutin:
Optimal Node Routing. STACS 2006: 596-607 - Vince Bárány:
Invariants of Automatic Presentations and Semi-synchronous Transductions. STACS 2006: 289-300 - Vince Bárány, Christof Löding, Olivier Serre:
Regularity Problems for Visibly Pushdown Languages. STACS 2006: 420-431 - Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor:
Generalized Modal Satisfiability. STACS 2006: 500-511 - Marie-Pierre Béal, Dominique Perrin:
Complete Codes in a Sofic Shift. STACS 2006: 127-136 - Ahmed A. Belal, Amr Elmasry:
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes. STACS 2006: 92-103 - Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer:
DAG-Width and Parity Games. STACS 2006: 524-536 - Iwona Bialynicka-Birula, Roberto Grossi:
Amortized Rigidness in Dynamic Cartesian Trees. STACS 2006: 80-91 - Manuel Bodirsky, Víctor Dalmau:
Datalog and Constraint Satisfaction with Infinite Templates. STACS 2006: 646-659 - Harry Buhrman, Leen Torenvliet, Falk Unger:
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds. STACS 2006: 455-468 - Venkatesan T. Chakaravarthy, Sambuddha Roy:
Oblivious Symmetric Alternation. STACS 2006: 230-241 - Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan:
Estimating Entropy and Entropy Norm on Data Streams. STACS 2006: 196-205 - Krishnendu Chatterjee, Thomas A. Henzinger:
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games. STACS 2006: 512-523 - Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger:
Markov Decision Processes with Multiple Objectives. STACS 2006: 325-336 - George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos:
Convergence and Approximation in Potential Games. STACS 2006: 349-360 - Reuven Cohen, David Peleg:
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. STACS 2006: 549-560 - Mirela Damian, Robin Y. Flatland, Joseph O'Rourke:
Grid Vertex-Unfolding Orthogonal Polyhedra. STACS 2006: 264-276 - Josep Díaz, Dimitrios M. Thilikos:
Fast FPT-Algorithms for Cleaning Grids. STACS 2006: 361-371 - Benjamin Doerr:
Generating Randomized Roundings with Cardinality Constraints and Derandomizations. STACS 2006: 571-583 - Chinmoy Dutta, Jaikumar Radhakrishnan:
Tradeoffs in Depth-Two Superconcentrators. STACS 2006: 372-383 - Khaled M. Elbassioni, Nabil H. Mustafa:
Conflict-Free Colorings of Rectangles Ranges. STACS 2006: 254-263 - Joost Engelfriet, Hendrik Jan Hoogeboom:
Nested Pebbles and Transitive Closure. STACS 2006: 477-488 - Kousha Etessami, Mihalis Yannakakis:
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. STACS 2006: 634-645 - Rolf Fagerberg, Anna Pagh, Rasmus Pagh:
External String Sorting: Faster and Cache-Oblivious. STACS 2006: 68-79 - Olivier Finkel:
On the Accepting Power of 2-Tape Büchi Automata. STACS 2006: 301-312
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-05-01 16:16 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