Остановите войну!
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 54 matches
- 1988
- Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju:
Sorting with Efficient Use of Special-Purpose Sorters. Inf. Process. Lett. 27(1): 13-15 (1988) - Franz Baader:
A Note on Unification Type Zero. Inf. Process. Lett. 27(2): 91-93 (1988) - M. Balakrishnan, S. Sutarwala, Arun K. Majumdar, Dilip K. Banerji, James G. Linders:
A Semantic Approach for Modular Synthesis of VLSI Systems. Inf. Process. Lett. 27(1): 1-7 (1988) - Dominique Roelants van Baronaigien, Frank Ruskey:
Generating t-ary Trees in A-Order. Inf. Process. Lett. 27(4): 205-213 (1988) - Joel Berman, Willem J. Blok:
Positive Boolean Dependencies. Inf. Process. Lett. 27(3): 147-150 (1988) - Alan A. Bertossi:
Parallel Circle-Cover Algorithms. Inf. Process. Lett. 27(3): 133-139 (1988) - Hans L. Bodlaender:
A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. Inf. Process. Lett. 27(6): 287-290 (1988) - Khaled M. Bugrara, Paul Walton Purdom Jr.:
An Exponential Lower Bound for the Pure Literal Rule. Inf. Process. Lett. 27(4): 215-219 (1988) - Sharat Chandran, Azriel Rosenfeld:
Order Statistics on a Hypercube. Inf. Process. Lett. 27(3): 129-132 (1988) - Chin-Chen Chang, C. H. Chang:
An Ordered Minimal Perfect Hashing Scheme with Single Parameter. Inf. Process. Lett. 27(2): 79-83 (1988) - Bogdan S. Chlebus:
A Parallel Bucket Sort. Inf. Process. Lett. 27(2): 57-61 (1988) - Stephen A. Cook, Michael Luby:
A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. Inf. Process. Lett. 27(3): 141-145 (1988) - Abdol-Hossein Esfahanian, S. Louis Hakimi:
On Computing a Conditional Edge-Connectivity of a Graph. Inf. Process. Lett. 27(4): 195-199 (1988) - Ulrich Faigle, Rainer Schrader:
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. Inf. Process. Lett. 27(4): 189-194 (1988) - David Fernández-Baca:
Nonserial Dynamic Programming Formulations of Satisfiability. Inf. Process. Lett. 27(6): 323-326 (1988) - Alan M. Frieze:
On the Random Construction of Heaps. Inf. Process. Lett. 27(2): 103-109 (1988) - Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. Inf. Process. Lett. 27(5): 259-263 (1988) - Alan Gibbons, Amos Israeli, Wojciech Rytter:
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. Inf. Process. Lett. 27(1): 43-51 (1988) - Leszek Holenderski, Andrzej Szalas:
Propositional Description of Finite Cause-Effect Structures. Inf. Process. Lett. 27(3): 111-117 (1988) - Meichun Hsu, Stuart E. Madnick:
Shifting Timestamps for Concurrency Control in an Information Hierarchy. Inf. Process. Lett. 27(6): 291-297 (1988) - Xiaoqiu Huang:
A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function. Inf. Process. Lett. 27(6): 319-321 (1988) - Kozo Itano, Yutaka Sato, Hidemi Hirai, Tomoyoshi Yamagata:
An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner. Inf. Process. Lett. 27(5): 253-258 (1988) - David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis:
On Generating All Maximal Independent Sets. Inf. Process. Lett. 27(3): 119-123 (1988) - Mark B. Josephs:
The Data Refinement Calculator for Z Specifications. Inf. Process. Lett. 27(1): 29-33 (1988) - Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. Inf. Process. Lett. 27(5): 227-236 (1988) - Richard Koo, Sam Toueg:
Effects of Message Loss on the Termination of Distributed Protocols. Inf. Process. Lett. 27(4): 181-188 (1988) - Krishnaprasad Thirunarayan:
On the Computability of Circumscription. Inf. Process. Lett. 27(5): 237-243 (1988) - Mirko Krvanek:
The Complexity of Ultrametric Partitions on Graphs. Inf. Process. Lett. 27(5): 265-270 (1988) - Ashok Kumar, Vishv M. Malhotra:
A New Computation Rule for Prolog. Inf. Process. Lett. 27(5): 249-252 (1988) - Shay Kutten:
Optimal Fault-Tolerant Distributed Construction of a Spanning Forest. Inf. Process. Lett. 27(6): 299-307 (1988)
skipping 24 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-05-27 13:17 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