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 69 matches
- 1999
- Miklós Ajtai:
Generating Hard Instances of the Short Basis Problem. ICALP 1999: 1-9 - Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh:
Bounded Depth Arithmetic Circuits: Counting and Closure. ICALP 1999: 149-158 - Rajeev Alur, Sampath Kannan, Mihalis Yannakakis:
Communicating Hierarchical State Machines. ICALP 1999: 169-178 - Rajeev Alur, Kousha Etessami, Salvatore La Torre, Doron A. Peled:
Parametric Temporal Logic for "Model Measuring". ICALP 1999: 159-168 - Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim:
Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP 1999: 179-189 - Marek A. Bednarczyk, Andrzej M. Borzyszkowski:
General Morphisms of Petri Nets (Extended Abstract). ICALP 1999: 190-199 - Piotr Berman, Marek Karpinski:
On Some Tighter Inapproximability Results (Extended Abstract). ICALP 1999: 200-209 - Patricia Bouyer, Antoine Petit:
Decomposition and Composition of Timed Automata. ICALP 1999: 210-219 - N. G. de Bruijn:
A Model for Associative Memory, a Basis for Thinking and Consciousness. ICALP 1999: 74-89 - Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi:
New Applications of the Incompressibility Method. ICALP 1999: 220-229 - Luca Cardelli:
Wide Area Computation. ICALP 1999: 10-24 - Luca Cardelli, Andrew D. Gordon, Giorgio Ghelli:
Mobility Types for Mobile Ambients. ICALP 1999: 230-239 - Peter Clote:
Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains. ICALP 1999: 240-249 - Kevin J. Compton, Scott D. Dexter:
Proof Techniques for Cryptographic Protocols. ICALP 1999: 25-39 - Véronique Cortier, Harald Ganzinger, Florent Jacquemard, Margus Veanes:
Decidable Fragments of Simultaneous Rigid Reachability. ICALP 1999: 250-260 - Karl Crary, J. Gregory Morrisett:
Type Structure for Low-Level Programming Languages. ICALP 1999: 40-54 - Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi:
Text Compression Using Antidictionaries. ICALP 1999: 261-270 - Felipe Cucker:
Real Computations with Fake Numbers. ICALP 1999: 55-73 - Martin Dickhöfer, Thomas Wilke:
Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem. ICALP 1999: 281-290 - Yevgeniy Dodis, Sanjeev Khanna:
Space Time Tradeoffs for Graph Properties. ICALP 1999: 291-300 - Catherine Dufourd, Petr Jancar, Philippe Schnoebelen:
Boundedness of Reset P/T Nets. ICALP 1999: 301-310 - Abbas Edalat, Marko Krznaric:
Numerical Integration with Exact Real Arithmetic. ICALP 1999: 90-104 - Joost Engelfriet, Hendrik Jan Hoogeboom:
Two-Way Finite State Transducers and Monadic Second-Order Logic. ICALP 1999: 311-320 - Sergio Flesca, Sergio Greco:
Partially Ordered Regular Languages for Graph Queries. ICALP 1999: 321-330 - Markus Frick, Martin Grohe:
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. ICALP 1999: 331-340 - Vashti Galpin:
Comparison of Process Algebra Equivalences Using Formats. ICALP 1999: 341-350 - Cyril Gavoille, Nicolas Hanusse:
Compact Routing Tables for Graphs of Bounded Genus. ICALP 1999: 351-360 - Georg Gottlob, Nicola Leone, Francesco Scarcello:
Computing LOGCFL Certificates. ICALP 1999: 361-371 - Roberto Grossi, Giuseppe F. Italiano:
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures. ICALP 1999: 372-381 - Arvind Gupta, Damon Kaller, Thomas C. Shermer:
On the Complements of Partial k-Trees. ICALP 1999: 382-391
skipping 39 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-09-22 06: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