Остановите войну!
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 60 matches
- 1991
- Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul:
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(1.5 sqrt m/log n). Inf. Process. Lett. 37(4): 237-240 (1991) - Danièle Beauquier:
An Undecidable Problem About Rational Sets and Contour Words of Polyominoes. Inf. Process. Lett. 37(5): 257-263 (1991) - Richard Beigel, Lane A. Hemachandra, Gerd Wechsung:
Probabilistic Polynomial Time is Closed under Parity Reductions. Inf. Process. Lett. 37(2): 91-94 (1991) - Douglas M. Campbell, John Higgins:
Minimal Visibility Graphs. Inf. Process. Lett. 37(1): 49-53 (1991) - Svante Carlsson:
An Optimal Algorithm for Deleting the Root of a Heap. Inf. Process. Lett. 37(2): 117-120 (1991) - Chung-Kuo Chang, Mohamed G. Gouda:
On the Minimum Requirements for Independent Recovery in Distributed Systems. Inf. Process. Lett. 37(1): 1-7 (1991) - Soma Chaudhuri, Richard E. Ladner:
Safety and Liveness of omega-Context-Free Languages. Inf. Process. Lett. 37(1): 13-20 (1991) - Peter F. Corbett, Isaac D. Scherson:
A Unified Algorithm for Sorting on Multidimensional Mesh-Connected Processors. Inf. Process. Lett. 37(4): 225-231 (1991) - Olivier Danvy:
Semantics-Directed Compilation of Nonlinear Patterns. Inf. Process. Lett. 37(6): 315-322 (1991) - Xiaotie Deng, Sanjeev Mahajan:
Server Problems and Resistive Spaces. Inf. Process. Lett. 37(4): 193-196 (1991) - Pavol Duris, Imrich Vrto:
Semelectivity is not Sufficient. Inf. Process. Lett. 37(3): 137-141 (1991) - Jurek Czyzowicz, K. B. Lakshmanan, Andrzej Pelc:
Searching with a Forbidden Lie Pattern in Responses. Inf. Process. Lett. 37(3): 127-132 (1991) - Zvi Galil, Giuseppe F. Italiano:
A Note on Set Union with Arbitrary Deunions. Inf. Process. Lett. 37(6): 331-335 (1991) - Alan Gibbons, Ridha Ziani:
The Balanced Binary Tree Technique on Mesh-Connected Computers. Inf. Process. Lett. 37(2): 101-109 (1991) - Frederic Green:
An Oracle Separating \oplus P from PPPH. Inf. Process. Lett. 37(3): 149-153 (1991) - Chris C. Handley:
A Space Efficient Distributive Sort. Inf. Process. Lett. 37(2): 75-78 (1991) - Xin He:
An Efficient Parallel Algorithm for Finding Minimum Weight Matching for Points on a Convex Polygon. Inf. Process. Lett. 37(2): 111-116 (1991) - Micha Hofri, Hadas Shachnai:
On the Optimality of the Counter Scheme for Dynamic Linear Lists. Inf. Process. Lett. 37(3): 175-179 (1991) - Cornelis Huizing, Willem P. de Roever:
Introduction to Design Choices in the Semantics of Statecharts. Inf. Process. Lett. 37(4): 205-213 (1991) - Dung T. Huynh:
The Effective Entropies of Some Extensions of Context-Free Languages. Inf. Process. Lett. 37(3): 165-169 (1991) - Robert W. Irving:
On Approximating the Minimum Independent Dominating Set. Inf. Process. Lett. 37(4): 197-200 (1991) - Toshiya Itoh:
Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. Inf. Process. Lett. 37(5): 273-277 (1991) - David Pokrass Jacobs:
Probabilistic Checking of Associativity in Algebras. Inf. Process. Lett. 37(4): 187-191 (1991) - Augustus J. E. M. Janssen:
An Optimization Problem Related to Neural Networks. Inf. Process. Lett. 37(3): 155-157 (1991) - Bin Jiang:
Traversing Graphs in a Paging Environment, BFS or DFS? Inf. Process. Lett. 37(3): 143-147 (1991) - Anne Kaldewaij, Berry Schoenmakers:
The Derivation of a Tighter Bound for Top-Down Skew Heaps. Inf. Process. Lett. 37(5): 265-271 (1991) - Viggo Kann:
Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete. Inf. Process. Lett. 37(1): 27-35 (1991) - Myung-Joon Lee, Kwang-Moo Choe:
SLR(k) Covering for LR(k) Grammars. Inf. Process. Lett. 37(6): 337-347 (1991) - Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan:
A New Approach for the Domination Problem on Permutation Graphs. Inf. Process. Lett. 37(4): 219-224 (1991) - Igor Litovsky:
Prefix-Free Languages as omega-Generators. Inf. Process. Lett. 37(2): 61-65 (1991)
skipping 30 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-04-26 21:19 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