Остановите войну!
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 56 matches
- 1991
- Alberto Apostolico, Martin Farach, Costas S. Iliopoulos:
Optimal Superprimitivity Testing for Strings. Inf. Process. Lett. 39(1): 17-20 (1991) - Ricardo A. Baeza-Yates:
Height Balance Distribution of Search Trees. Inf. Process. Lett. 39(6): 317-324 (1991) - Dominique Roelants van Baronaigien:
A Loopless Algorithm for Generating Binary Tree Sequences. Inf. Process. Lett. 39(4): 189-194 (1991) - Abdulla Bataineh, Füsun Özgüner, Alok Sarwal:
Parallel Boolean Operations for Information Retrieval. Inf. Process. Lett. 39(2): 99-108 (1991) - A. Bijlsma:
Derivation of Logic Programs by Functional Methods. Inf. Process. Lett. 39(6): 325-332 (1991) - Ronald V. Book:
On Random Oracle Separations. Inf. Process. Lett. 39(1): 7-10 (1991) - Coenraad Bron, Wim H. Hesselink:
Smoothsort Revisited. Inf. Process. Lett. 39(5): 269-276 (1991) - Svante Carlsson, Jingsen Chen:
An Optimal Parallel Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 195-200 (1991) - Bernadette Charron-Bost:
Concerning the Size of Logical Clocks in Distributed Systems. Inf. Process. Lett. 39(1): 11-16 (1991) - Jianer Chen:
Characterizing Parallel Hierarchies by Reducibilities. Inf. Process. Lett. 39(6): 303-307 (1991) - Jianer Chen, Jim Cox, Bud Mishra:
An NL Hierarchy. Inf. Process. Lett. 39(1): 21-26 (1991) - Nian-Shing Chen, Hwey-Pyng Yu, Shing-Tsaan Huang:
A Self-Stabilizing Algorithm for Constructing Spanning Trees. Inf. Process. Lett. 39(3): 147-151 (1991) - Davide Crippa:
A Special Case of the Dynamization Problem for Least Cost Paths. Inf. Process. Lett. 39(6): 297-302 (1991) - Alessandro Fantechi, Stefania Gnesi:
Compositionality and Bisimulation: A Negative Result. Inf. Process. Lett. 39(2): 109-114 (1991) - Pierre Fraigniaud, Claudine Peyrat:
Broadcasting in a Hypercube when Some Calls Fail. Inf. Process. Lett. 39(3): 115-119 (1991) - M. L. Garg, Syed I. Ahson, P. V. Gupta:
A Fuzzy Petri Net for Knowledge Representation and Reasoning. Inf. Process. Lett. 39(3): 165-171 (1991) - Roberto Grossi:
A Note on the Subtree Isomorphism for Ordered Trees and Related Problems. Inf. Process. Lett. 39(2): 81-84 (1991) - Paul J. Heffernan:
The Translation Square Map and Approximate Congruence. Inf. Process. Lett. 39(3): 153-159 (1991) - Thomas Hofmeister, Walter Hohberg, Susanne Köhling:
Some Notes on Threshold Circuits, and Multiplication in Depth 4. Inf. Process. Lett. 39(4): 219-225 (1991) - Rodney R. Howell:
The Complexity of Problems Involving Structurally Bounded and Conservative Petri Nets. Inf. Process. Lett. 39(6): 309-315 (1991) - Lih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, Maw-Sheng Chern:
Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. Inf. Process. Lett. 39(5): 277-281 (1991) - Bing-Chao Huang, Michael A. Langston:
Stable Set and Multiset Operations in Optimal Time and Space. Inf. Process. Lett. 39(3): 131-136 (1991) - Sandy Irani, Ronitt Rubinfeld:
A Competitive 2-Server Algorithm. Inf. Process. Lett. 39(2): 85-91 (1991) - Janice Jeffs:
Order Independent NCE Grammars Recognized in Polynomial Time. Inf. Process. Lett. 39(3): 161-164 (1991) - Dimitris Kavadias, Lefteris M. Kirousis, Paul G. Spirakis:
The Complexity of the Reliable Connectivity Problem. Inf. Process. Lett. 39(5): 245-252 (1991) - J. Mark Keil:
A Simple Algorithm for Determining the Envelope of a Set of Lines. Inf. Process. Lett. 39(3): 121-124 (1991) - Christos Levcopoulos, Ola Petersson:
Splitsort - An Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 205-211 (1991) - Fabrizio Luccio, Linda Pagli:
An Efficient Algorithm for Some Tree Matching Problems. Inf. Process. Lett. 39(1): 51-57 (1991) - Jirí Matousek:
Randomized Optimal Algorithm for Slope Selection. Inf. Process. Lett. 39(4): 183-187 (1991) - Robert J. T. Morris, Wing Shing Wong:
Systematic Choice of Initial Points in Local Search: Extensions and Application to Neural Networks. Inf. Process. Lett. 39(4): 213-217 (1991)
skipping 26 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-25 15:21 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