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 83 matches
- 1998
- Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
Combinatorial Hardness Proofs for Polynomial Evaluation. MFCS 1998: 167-175 - Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi:
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. MFCS 1998: 176-184 - Kazuyuki Amano, Akira Maruoka:
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. MFCS 1998: 399-408 - Andris Ambainis, David A. Mix Barrington, Huong LeThanh:
On Counting AC0 Circuits with Negative Constants. MFCS 1998: 409-417 - Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt:
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. MFCS 1998: 465-473 - Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
On the Complexity of Wavelength Converters. MFCS 1998: 771-779 - Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni:
Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. MFCS 1998: 1-16 - Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith:
Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. MFCS 1998: 203-212 - Gilles Barthe:
The Semi-Full Closure of Pure Type Systems. MFCS 1998: 316-325 - Klaus Barthelmann:
When Can an Equational Simple Graph Be Generated by Hyperedge Replacement? MFCS 1998: 543-552 - Marcin Benke:
Predicative Polymorphic Subtyping. MFCS 1998: 326-335 - Levke Bentzien:
Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. MFCS 1998: 474-482 - Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder:
Embedding of Hypercubes into Grids. MFCS 1998: 693-701 - Gavin M. Bierman:
A Computational Interpretation of the lambda-µ-Calculus. MFCS 1998: 336-345 - Hans L. Bodlaender, Torben Hagerup:
Tree Decompositions of Small Diameter. MFCS 1998: 702-712 - Richard F. Bonner, Rusins Freivalds, Janis Lapins, Antra Lukjanska:
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages. MFCS 1998: 213-219 - Egon Börger, Wolfram Schulte:
Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation. MFCS 1998: 17-35 - Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra:
Degree-Preserving Forests. MFCS 1998: 713-721 - Thomas Buchholz, Andreas Klein, Martin Kutrib:
One Guess One-Way Cellular Arrays. MFCS 1998: 807-815 - Gianpiero Cattaneo, Luciano Margara:
Topological Definitions of Chaos Applied to Cellular Automata Dynamics. MFCS 1998: 816-824 - Christian Choffrut, Sándor Horváth:
Equations in Transfinite Strings. MFCS 1998: 656-664 - Marek Chrobak, Christoph Dürr:
Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms. MFCS 1998: 185-193 - Jacek Chrzaszcz:
Polymorphic Subtyping Without Distributivity. MFCS 1998: 346-355 - Bruno Courcelle, Denis Lapoire:
Facial Circuits of Planar Graphs and Context-Free Languages. MFCS 1998: 616-624 - Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders:
A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731 - Maxime Crochemore, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Factor Automata. MFCS 1998: 665-673 - Carsten Damm:
On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols. MFCS 1998: 780-788 - Bruno Durand, Sylvain Porrot:
Comparison Between the Complexity of a Function and the Complexity of Its Graph. MFCS 1998: 732-739 - E. Allen Emerson, Richard J. Trefler:
Model Checking Real-Time Properties of Symmetric Systems. MFCS 1998: 427-436 - Henning Fernau, Ludwig Staiger:
IFS and Control Languages. MFCS 1998: 740-750
skipping 53 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-10-02 04:38 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