Остановите войну!
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 55 matches
- 1988
- Claudio Arbib:
A Polynomial Characterization of Some Graph Partitioning Problems. Inf. Process. Lett. 26(5): 223-230 (1988) - Marc Bezem, Jan van Leeuwen:
On Estimating the Complexity of Logarithmic Decompositions. Inf. Process. Lett. 26(6): 321-324 (1988) - Tat-hung Chan:
The Boundedness Problem for Three-Dimensional Vector Addition Systems with States. Inf. Process. Lett. 26(6): 287-289 (1988) - Israel Cidon:
Yet Another Distributed Depth-First-Search Algorithm. Inf. Process. Lett. 26(6): 301-305 (1988) - Richard J. Cole:
An Optimally Efficient Selection Algorithm. Inf. Process. Lett. 26(6): 295-299 (1988) - Stephen A. Cook:
Short Propositional Formulas Represent Nondeterministic Computations. Inf. Process. Lett. 26(5): 269-270 (1988) - Karel Culík II, Juhani Karhumäki:
On Totalistic Systolic Networks. Inf. Process. Lett. 26(5): 231-236 (1988) - Ludwik Czaja:
Cause-Effect Structures. Inf. Process. Lett. 26(6): 313-319 (1988) - Patrick W. Dymond:
Input-Driven Languages are in log n Depth. Inf. Process. Lett. 26(5): 247-250 (1988) - John R. Gilbert:
Some Nested Dissection Order is Nearly Optimal. Inf. Process. Lett. 26(6): 325-328 (1988) - Ganesh Gopalakrishnan, Mandayam K. Srivas:
Implementing Functional Programs Using Mutable Abstract Data Types. Inf. Process. Lett. 26(6): 277-286 (1988) - Klaus H. Hinrichs, Jürg Nievergelt, Peter Schorn:
Plane-Sweep Solves the Closest Pair Problem Elegantly. Inf. Process. Lett. 26(5): 255-261 (1988) - Rolf G. Karlsson, Mark H. Overmars:
Normalized Divide-and-Conquer: A Scaling Technique for Solving Multi-Dimensional Problems. Inf. Process. Lett. 26(6): 307-312 (1988) - Bruce M. Maggs, Serge A. Plotkin:
Minimum-Cost Spanning Tree as a Path-Finding Problem. Inf. Process. Lett. 26(6): 291-293 (1988) - Erkki Mäkinen:
On the Rotation Distance of Binary Trees. Inf. Process. Lett. 26(5): 271-272 (1988) - Carroll Morgan:
Data Refinement by Miracles. Inf. Process. Lett. 26(5): 243-246 (1988) - Joel I. Seiferas:
A Variant of Ben-Or's Lower Bound for Algebraic Decision Trees. Inf. Process. Lett. 26(5): 273-276 (1988) - Andrzej Sieminski:
Fast Decoding of the Huffman Codes. Inf. Process. Lett. 26(5): 237-241 (1988) - Eljas Soisalon-Soininen, Jorma Tarhio:
Looping LR Parsers. Inf. Process. Lett. 26(5): 251-253 (1988) - Olivier Y. de Vel, E. V. Krishnamurthy:
An Iterative Pipelined Array Architecture for the Generalized Matrix Inversion. Inf. Process. Lett. 26(5): 263-267 (1988) - 1987
- Alberto Apostolico, Susanne E. Hambrusch:
Finding Maximum Cliques on Circular-Arc Graphs. Inf. Process. Lett. 26(4): 209-215 (1987) - Krzysztof R. Apt, Luc Bougé, Philippe Clermont:
Two Normal Form Theorems for CSP Programs. Inf. Process. Lett. 26(4): 165-171 (1987) - László Babai:
Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy. Inf. Process. Lett. 26(1): 51-53 (1987) - Cristian Baleanu, Dan Tomescu:
An Architecture for Symbolic Processing. Inf. Process. Lett. 26(4): 217-222 (1987) - Jean-Claude Bermond, Jean-Michel Fourneau, Alain Jean-Marie:
Equivalence of Multistage Interconnection Networks. Inf. Process. Lett. 26(1): 45-50 (1987) - Jean Berstel, Srecko Brlek:
On the Length of Word Chains. Inf. Process. Lett. 26(1): 23-28 (1987) - Alfs T. Berztiss:
A Notation for Distributed Operations. Inf. Process. Lett. 26(1): 19-21 (1987) - Ronald V. Book, Hai-Ning Liu:
Rewriting Systems and Word Problems in a Free Partially Commutative Monoid. Inf. Process. Lett. 26(1): 29-32 (1987) - Svante Carlsson:
The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. Inf. Process. Lett. 26(1): 33-36 (1987) - James R. Driscoll, Sheau-Dong Lang, LeRoy A. Franklin:
Modeling B-Tree Insertion Activity. Inf. Process. Lett. 26(1): 5-18 (1987)
skipping 25 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-23 20:53 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