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
- 2005
- Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer:
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. MFCS 2005: 71-82 - César Luis Alonso, José Luis Montaña, Luis Miguel Pardo:
On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. MFCS 2005: 83-94 - Carme Àlvarez, Joaquim Gabarró, Maria J. Serna:
Pure Nash Equilibria in Games with a Large Number of Actions. MFCS 2005: 95-106 - Kazuyuki Amano, Akira Maruoka:
On the Complexity of Depth-2 Circuits with Threshold Gates. MFCS 2005: 107-118 - Michael Bauland, Edith Hemaspaandra:
Isomorphic Implication. MFCS 2005: 119-130 - Valérie Berthé, Michel Rigo:
Abstract Numeration Systems and Tilings. MFCS 2005: 131-143 - Marcin Bienkowski, Friedhelm Meyer auf der Heide:
Page Migration in Dynamic Networks. MFCS 2005: 1-14 - Maria J. Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria J. Serna:
Adversarial Queueing Model for Continuous Network Dynamics. MFCS 2005: 144-155 - Julia Böttcher:
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time. MFCS 2005: 156-167 - Arnaud Carayol:
Regular Sets of Higher-Order Pushdown Stacks. MFCS 2005: 168-179 - Arnaud Carayol, Antoine Meyer:
Linearly Bounded Infinite Graphs. MFCS 2005: 180-191 - Julien Cervelle, Enrico Formenti, Benoît Masson:
Basic Properties for Sand Automata. MFCS 2005: 192-211 - Jérémie Chalopin, Yves Métivier:
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs. MFCS 2005: 212-223 - Ho-Leung Chan, Jesper Jansson, Tak Wah Lam, Siu-Ming Yiu:
Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix. MFCS 2005: 224-235 - Wun-Tat Chan, Tak Wah Lam, Kin-Shing Liu, Prudence W. H. Wong:
New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. MFCS 2005: 236-247 - Ho-Lun Cheng, Tony Tan:
Approximating Polygonal Objects by Deformable Smooth Surfaces. MFCS 2005: 248-259 - Dimitri Chubarov, Andrei Voronkov:
Basis of Solutions for a System of Linear Inequalities in Integers: Computation and Applications. MFCS 2005: 260-270 - David Doty, Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo, Philippe Moser:
Zeta-Dimension. MFCS 2005: 283-294 - Leah Epstein, Meital Levy:
Online Interval Coloring with Packing Constraints. MFCS 2005: 295-307 - Piotr Faliszewski, Mitsunori Ogihara:
Separating the Notions of Self- and Autoreducibility. MFCS 2005: 308-315 - Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry:
Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. MFCS 2005: 316-327 - Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs. MFCS 2005: 328-339 - Jirí Fiala, Daniël Paulusma, Jan Arne Telle:
Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms. MFCS 2005: 340-351 - Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba:
Packing Weighted Rectangles into a Square. MFCS 2005: 352-363 - Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse:
Nondeterministic Graph Searching: From Pathwidth to Treewidth. MFCS 2005: 364-375 - Rusins Freivalds:
Knot Theory, Jones Polynomial and Quantum Computing. MFCS 2005: 15-25 - Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro:
Goals in the Propositional Horn Language Are Monotone Boolean Circuits. MFCS 2005: 376-386 - Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang:
Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398 - Christian Glaßer, Alan L. Selman, Liyu Zhang:
Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS 2005: 399-409 - Judy Goldsmith, Matthias Hagen, Martin Mundhenk:
Complexity of DNF and Isomorphism of Monotone Formulas. MFCS 2005: 410-421
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-10-01 23:26 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