Остановите войну!
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 50 matches
- 2006
- Étienne Ailloud, Arnaud Durand:
The Expressive Power of Bijections over Weakly Arithmetized Structures. Theory Comput. Syst. 39(2): 297-309 (2006) - Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien:
Algebraic Results on Quantum Automata. Theory Comput. Syst. 39(1): 165-188 (2006) - Konstantin Andreev, Harald Räcke:
Balanced Graph Partitioning. Theory Comput. Syst. 39(6): 929-939 (2006) - Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler:
The Effect of Faults on Network Expansion. Theory Comput. Syst. 39(6): 903-928 (2006) - Sebastian Bala:
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms. Theory Comput. Syst. 39(1): 137-163 (2006) - Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006) - Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro:
Insertion Sort is O(n log n). Theory Comput. Syst. 39(3): 391-397 (2006) - Anna Bernasconi, Valentina Ciriani, Fabrizio Luccio, Linda Pagli:
Exploiting Regularities for Boolean Function Synthesis. Theory Comput. Syst. 39(4): 485-501 (2006) - Alberto Bertoni, Christian Choffrut, Massimiliano Goldwurm, Violetta Lonati:
Local Limit Properties for Pattern Statistics and Rational Models. Theory Comput. Syst. 39(1): 209-235 (2006) - Sebastian Böcker:
Sequencing from Compomers: The Puzzle. Theory Comput. Syst. 39(3): 455-471 (2006) - Paolo Bottoni, Anna Labella, Vincenzo Manca, Victor Mitrana:
Superposition Based on Watson-Crick-Like Complementarity. Theory Comput. Syst. 39(4): 503-524 (2006) - Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin:
Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst. 39(4): 561-590 (2006) - Jin-yi Cai, Venkatesan T. Chakaravarthy, Dieter van Melkebeek:
Time-Space Tradeoff in Derandomizing Probabilistic Logspace. Theory Comput. Syst. 39(1): 189-208 (2006) - Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
Energy-Efficient Wireless Network Design. Theory Comput. Syst. 39(5): 593-617 (2006) - Jean Cardinal, Steve Kremer, Stefan Langerman:
Juggling with Pattern Matching. Theory Comput. Syst. 39(3): 425-437 (2006) - Fan R. K. Chung, Ronald L. Graham, Jia Mao, George Varghese:
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines. Theory Comput. Syst. 39(6): 829-849 (2006) - Mark Daley, Ian McQuillan:
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates. Theory Comput. Syst. 39(5): 619-633 (2006) - Erik D. Demaine, Martin L. Demaine:
Puzzles, Art, and Magic with Algorithms. Theory Comput. Syst. 39(3): 473-481 (2006) - Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman:
Morpion Solitaire. Theory Comput. Syst. 39(3): 439-453 (2006) - Kedar Dhamdhere, Anupam Gupta, R. Ravi:
Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006) - Volker Diekert, Michel Habib:
Foreword. Theory Comput. Syst. 39(1): 1 (2006) - Stefan Droste, Thomas Jansen, Ingo Wegener:
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization. Theory Comput. Syst. 39(4): 525-544 (2006) - Paolo Ferragina, Roberto Grossi, Fabrizio Luccio:
Foreword. Theory Comput. Syst. 39(3): 389 (2006) - Gianni Franceschini, Roberto Grossi:
Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput. Syst. 39(2): 321-345 (2006) - Richard Gault, Iain A. Stewart:
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes. Theory Comput. Syst. 39(5): 753-783 (2006) - Navin Goyal, Sachin Lodha, S. Muthukrishnan:
The Graham-Knowlton Problem Revisited. Theory Comput. Syst. 39(3): 399-412 (2006) - Jens Gramm, Jiong Guo, Rolf Niedermeier:
Parameterized Intractability of Distinguishing Substring Selection. Theory Comput. Syst. 39(4): 545-560 (2006) - Torben Hagerup:
Simpler Computation of Single-Source Shortest Paths in Linear Average Time. Theory Comput. Syst. 39(1): 113-120 (2006) - Kristoffer Arnsfelt Hansen:
Constant Width Planar Computation Characterizes ACC0. Theory Comput. Syst. 39(1): 79-92 (2006) - Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand:
The Complexity of Finding Top-Toda-Equivalence-Class Members. Theory Comput. Syst. 39(5): 669-684 (2006)
skipping 20 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-10 22:39 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