Остановите войну!
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 37 matches
- 2005
- Helmut Alt:
Foreword. Theory Comput. Syst. 38(2): 133 (2005) - Christoph Ambühl, Uli Wagner:
The Clique Problem in Intersection Graphs of Ellipses and Triangles. Theory Comput. Syst. 38(3): 279-292 (2005) - Adi Avidor, Uri Zwick:
Approximating MIN 2-SAT and MIN 3-SAT. Theory Comput. Syst. 38(3): 329-345 (2005) - Therese C. Biedl, Dana F. Wilkinson:
Bounded-Degree Independent Sets in Planar Graphs. Theory Comput. Syst. 38(3): 253-278 (2005) - Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Theory Comput. Syst. 38(6): 671-685 (2005) - Gian Carlo Bongiovanni, Paolo Penna:
XOR-Based Schemes for Fast Parallel IP Lookups. Theory Comput. Syst. 38(4): 481-501 (2005) - Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Raffaele Mosca:
New Graph Classes of Bounded Clique-Width. Theory Comput. Syst. 38(5): 623-645 (2005) - Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty. Theory Comput. Syst. 38(4): 411-423 (2005) - Véronique Bruyère, Olivier Carton:
Hierarchy Among Automata on Linear Orderings. Theory Comput. Syst. 38(5): 593-621 (2005) - Christoph Buchheim, Seok-Hee Hong:
Crossing Minimization for Symmetries. Theory Comput. Syst. 38(3): 293-311 (2005) - Harry Buhrman, Lance Fortnow, Aduri Pavan:
Some Results on Derandomization. Theory Comput. Syst. 38(2): 211-227 (2005) - Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong:
On-line Stream Merging with Max Span and Min Coverage. Theory Comput. Syst. 38(4): 461-479 (2005) - Marc Demange, Vangelis Th. Paschos:
Improved Approximations for Weighted and Unweighted Graph Problems. Theory Comput. Syst. 38(6): 763-787 (2005) - Manfred Droste, Christian Pech, Heiko Vogler:
A Kleene Theorem for Weighted Tree Automata. Theory Comput. Syst. 38(1): 1-38 (2005) - Cesim Erten, Stephen G. Kobourov:
Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. Theory Comput. Syst. 38(3): 313-327 (2005) - Irene Finocchi, Rossella Petreschi:
Structure-Preserving Hierarchical Decompositions. Theory Comput. Syst. 38(6): 687-700 (2005) - Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis:
Space Efficient Hash Tables with Worst Case Constant Access Time. Theory Comput. Syst. 38(2): 229-248 (2005) - Lee-Ad Gottlieb, John E. Savage, Arkady Yerukhimovich:
Efficient Data Storage in Large Nanoarrays. Theory Comput. Syst. 38(4): 503-536 (2005) - Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier:
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation. Theory Comput. Syst. 38(4): 373-392 (2005) - John M. Hitchcock:
Correspondence Principles for Effective Dimensions. Theory Comput. Syst. 38(5): 559-571 (2005) - Tomasz Jurdzinski, Grzegorz Stachowiak:
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks. Theory Comput. Syst. 38(3): 347-367 (2005) - Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky:
Unlocking the Advantages of Dynamic Service Selection and Pricing. Theory Comput. Syst. 38(4): 393-410 (2005) - Juhani Karhumäki, Michel Latteux, Ion Petre:
Commutation with Ternary Sets of Words. Theory Comput. Syst. 38(2): 161-169 (2005) - Sven Kosub:
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems. Theory Comput. Syst. 38(1): 83-113 (2005) - Dimitrios Koukopoulos, Marios Mavronicolas, Sotiris E. Nikoletseas, Paul G. Spirakis:
The Impact of Network Structure on the Stability of Greedy Protocols. Theory Comput. Syst. 38(4): 425-460 (2005) - Dietrich Kuske, Markus Lohrey:
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput. Syst. 38(1): 39-81 (2005) - Frédéric Magniez:
Multi-Linearity Self-Testing with Relative Error. Theory Comput. Syst. 38(5): 573-591 (2005) - Enrico Pontelli, Desh Ranjan:
A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines. Theory Comput. Syst. 38(1): 115-130 (2005) - Giuseppe Prencipe:
The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots. Theory Comput. Syst. 38(5): 539-558 (2005) - Richard Edwin Stearns, Harry B. Hunt III:
Resource Bounds and Subproblem Independence. Theory Comput. Syst. 38(6): 731-761 (2005)
skipping 7 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-29 19:49 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