Остановите войну!
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 70 matches
- 2006
- Oswin Aichholzer, Clemens Huemer, Sarah Kappes, Bettina Speckmann, Csaba D. Tóth:
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles. MFCS 2006: 86-97 - Lyudmil Aleksandrov, Hristo N. Djidjev, Hua Guo, Anil Maheshwari, Doron Nussbaum, Jörg-Rüdiger Sack:
Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. MFCS 2006: 98-109 - Cyril Allauzen, Mehryar Mohri:
A Unified Construction of the Glushkov, Follow, and Antimirov Automata. MFCS 2006: 110-121 - Pablo Arrighi:
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata. MFCS 2006: 122-133 - Vikraman Arvind, Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS 2006: 134-145 - Richard Beigel, William I. Gasarch, James Glenn:
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems. MFCS 2006: 146-156 - Jean Berstel, Alessandra Savelli:
Crochemore Factorization of Sturmian and Other Infinite Words. MFCS 2006: 157-166 - Francine Blanchet-Sadri, D. Dakota Blair, Rebeca V. Lewis:
Equations on Partial Words. MFCS 2006: 167-178 - Joan Boyar, René Peralta:
Concrete Multiplicative Complexity of Symmetric Functions. MFCS 2006: 179-189 - Laurent Boyer, Victor Poupet, Guillaume Theyssier:
On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures. MFCS 2006: 190-201 - Ulrik Brandes, Jürgen Lerner:
Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities. MFCS 2006: 202-213 - Arnaud Carayol, Didier Caucal:
The Kleene Equality for Graphs. MFCS 2006: 214-225 - Arturo Carpi:
On the Repetition Threshold for Large Alphabets. MFCS 2006: 226-237 - Jianer Chen, Iyad A. Kanj, Ge Xia:
Improved Parameterized Upper Bounds for Vertex Cover. MFCS 2006: 238-249 - Qi Cheng:
On Comparing Sums of Square Roots of Small Integers. MFCS 2006: 250-255 - Alessandra Cherubini, Pawel Gawrychowski, Andrzej Kisielewicz, Brunetto Piochi:
A Combinatorial Approach to Collapsing Words. MFCS 2006: 256-266 - Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov:
Optimal Linear Arrangement of Interval Graphs. MFCS 2006: 267-279 - Sorin Constantinescu, Lucian Ilie:
The Lempel-Ziv Complexity of Fixed Points of Morphisms. MFCS 2006: 280-291 - Vincent Cremet, François Garillot, Sergueï Lenglet, Martin Odersky:
A Core Calculus for Scala Type Checking. MFCS 2006: 1-23 - Volker Diekert, Markus Lohrey, Alexander Miller:
Partially Commutative Inverse Monoids. MFCS 2006: 292-304 - Norbert Dojer:
Learning Bayesian Networks Does Not Have to Be NP-Hard. MFCS 2006: 305-314 - Michael Domaratzki, Kai Salomaa:
Lower Bounds for the Transition Complexity of NFAs. MFCS 2006: 315-326 - Miroslaw Dynia, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, Christian Schindelhauer:
Smart Robot Teams Exploring Sparse Trees. MFCS 2006: 327-338 - Robert Elsässer:
Toward the Eigenvalue Power Law. MFCS 2006: 351-362 - Angelo Fanelli, Michele Flammini, Giovanna Melideo, Luca Moscardelli:
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves. MFCS 2006: 363-374 - Lance Fortnow, Mitsunori Ogihara:
Very Sparse Leaf Languages. MFCS 2006: 375-386 - Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc:
Tree Exploration with an Oracle. MFCS 2006: 24-37 - Anna Gál, Vladimir Trifonov:
On the Correlation Between Parity and Modular Polynomials. MFCS 2006: 387-398 - François Le Gall:
Quantum Weakly Nondeterministic Communication Complexity. MFCS 2006: 658-669 - Luisa Gargano, Adele A. Rescigno:
Optimally Fast Data Gathering in Sensor Networks. MFCS 2006: 399-411
skipping 40 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-08 09:46 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