![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 51 matches
- 1992
- Pankaj K. Agarwal, Jirí Matousek:
On Range Searching with Semialgebraic Sets. MFCS 1992: 1-13 - Hannah Bast, Martin Dietzfelbinger
, Torben Hagerup:
A Perfect Parallel Dictionary. MFCS 1992: 133-141 - Bernd Becker
, Joachim Hartmann:
Some Remarks on the Test Complexity of Iterative Logic Arrays. MFCS 1992: 142-152 - Hans-Jörg Burtschick, Albrecht Hoene:
The Degree Structure of 1-L Reductions. MFCS 1992: 153-161 - Jin-yi Cai, Lane A. Hemachandra
, Jozef Vyskoc:
Promise Problems and Access to Unambiguous Computation. MFCS 1992: 162-171 - Suresh Chari, Desh Ranjan, Pankaj Rohatgi:
On the Complexity of Incremental Computation. MFCS 1992: 172-180 - Christian Choffrut, Massimiliano Goldwurm:
Rational Transductions and Complexity of Counting Problems. MFCS 1992: 181-190 - Hubert Comon, Maribel Fernández:
Negation Elimination in Equational Formulae. MFCS 1992: 191-199 - José Félix Costa, Amílcar Sernadas, Cristina Sernadas, Hans-Dieter Ehrich:
Object Interaction. MFCS 1992: 200-208 - Pierre-Louis Curien, Thérèse Hardin, Alejandro Ríos:
Strong Normalization of Substitutions. MFCS 1992: 209-217 - Robert P. Daley, Bala Kalyanasundaram:
Probabilistic and Pluralistic Learners with Mind Changes. MFCS 1992: 218-226 - Carsten Damm, Markus Holzer
, Klaus-Jörn Lange:
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. MFCS 1992: 227-235 - Denis Derencourt, Juhani Karhumäki, Michel Latteux, Alain Terlutte:
On Computational Power of Weighted Finite Automata. MFCS 1992: 236-245 - Josep Díaz:
Graph Layout Problems. MFCS 1992: 14-23 - Rainer Feldmann, Peter Mysliwietz:
The Shuffle Exchange Network has a Hamiltonian Path. MFCS 1992: 246-254 - Paul Gastin, Antoine Petit:
Poset Properties of Complex Traces. MFCS 1992: 255-263 - Andreas Goerdt:
A Threshold for Unsatisfiability. MFCS 1992: 264-274 - Robert Gold:
Dataflow Semantics for Petri Nets. MFCS 1992: 275-283 - Irène Guessarian, Marcos Veloso Peixoto:
About Boundedness for some DATALOG and DATALOG_neg Programs. MFCS 1992: 284-297 - Torben Hagerup, Ola Petersson:
Merging and Sorting Strings in Parallel. MFCS 1992: 298-306 - Petr Jancar
, Frantisek Mráz
, Martin Plátek:
Characterization of Context-Free Languages by Erasing Automata. MFCS 1992: 307-314 - Lila Kari:
Insertion and Deletion of Words: Determinism and Reversibility. MFCS 1992: 315-326 - Frantisek Kascak:
Small Universal One-State Linear Operator Algorithm. MFCS 1992: 327-335 - Cosimo Laneve
, Ugo Montanari:
Mobility in the CC-Paradigm. MFCS 1992: 336-345 - Klaus-Jörn Lange, Peter Rossmanith:
The Emptiness Problem for Intersections of Regular Languages. MFCS 1992: 346-354 - Klaus-Jörn Lange, Peter Rossmanith, Wojciech Rytter:
Parallel Recognition and Ranking of Context-Free Languages. MFCS 1992: 24-36 - Hing Leung:
On Finite Automata with Limited Nondeterminism. MFCS 1992: 355-363 - Igor Litovsky, Yves Métivier, Éric Sopena:
Definitions and Comparisons of Local Computations on Graphs. MFCS 1992: 364-373 - Bruno Martin
:
Efficient Unidimensional Universal Cellular Automaton. MFCS 1992: 374-382 - Osamu Maruyama, Satoru Miyano:
Inferring a Tree from Walks. MFCS 1992: 383-391
skipping 21 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-01 21:29 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