Остановите войну!
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 57 matches
- 1990
- Divyakant Agrawal, Amr El Abbadi:
Exploiting Logical Structures in Replicated Databases. Inf. Process. Lett. 33(5): 255-260 (1990) - Tom Altman, Bogdan S. Chlebus:
Sorting Roughly Sorted Sequences in Parallel. Inf. Process. Lett. 33(6): 297-300 (1990) - Richard J. Anderson, Gary L. Miller:
A Simple Randomized Parallel Algorithm for List-Ranking. Inf. Process. Lett. 33(5): 269-273 (1990) - Alan A. Bertossi, Sabrina Moretti:
Parallel Algorithms on Circular-Arc Graphs. Inf. Process. Lett. 33(6): 275-281 (1990) - Laurence Boxer, Russ Miller:
Common Intersections of Polygons. Inf. Process. Lett. 33(5): 249-254 (1990) - Pierluigi Crescenzi, Riccardo Silvestri:
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. Inf. Process. Lett. 33(5): 221-226 (1990) - Michael B. Dillencourt:
Realizability of Delaunay Triangulations. Inf. Process. Lett. 33(6): 283-287 (1990) - Zvi Galil, Kunsoo Park:
A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming. Inf. Process. Lett. 33(6): 309-311 (1990) - Neil J. Gunther, John G. Shaw:
Path Integral Evaluation of Aloha Network Transients. Inf. Process. Lett. 33(6): 289-295 (1990) - Torben Hagerup, Christine Rüb:
A Guided Tour of Chernoff Bounds. Inf. Process. Lett. 33(6): 305-308 (1990) - Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33(5): 233-238 (1990) - Philip Hingston, Ross Wilkinson:
A Distributed Join Algorithm. Inf. Process. Lett. 33(6): 313-317 (1990) - Jürgen Kämper:
A Result Relating Disjunctive Self-Reducibility to P-Immunity. Inf. Process. Lett. 33(5): 239-242 (1990) - C. S. Kannan, Henry Y. H. Chuang:
Fast Hough Transform on a Mesh Connected Processor Array. Inf. Process. Lett. 33(5): 243-248 (1990) - Samir Khuller, Joseph S. B. Mitchell:
On a Triangle Counting Problem. Inf. Process. Lett. 33(6): 319-321 (1990) - Edgar Knapp:
A Predicate Transformer for Progress. Inf. Process. Lett. 33(6): 323-330 (1990) - Stephan Olariu:
A Generalization of Chvátal's Star-Cutset Lemma. Inf. Process. Lett. 33(6): 301-303 (1990) - Victor Shoup:
On the Deterministic Complexity of Factoring Polynomials over Finite Fields. Inf. Process. Lett. 33(5): 261-267 (1990) - Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki:
A Linear Algorithm for Bipartition of Biconnected Graphs. Inf. Process. Lett. 33(5): 227-231 (1990) - 1989
- Selim G. Akl, David Gries, Ivan Stojmenovic:
An Optimal Parallel Algorithm for Generating Combinations. Inf. Process. Lett. 33(3): 135-139 (1989) - David Avis, J. M. Robert, Rephael Wenger:
Lower Bounds for Line Stabbing. Inf. Process. Lett. 33(2): 59-62 (1989) - Rudolf Berghammer, Gunther Schmidt, Hans Zierer:
Symmetric Quotients and Domain Constructions. Inf. Process. Lett. 33(3): 163-168 (1989) - Ronald V. Book, Shouwen Tang:
A Note on Sparse Sets and the Polynomial-Time Hierarchy. Inf. Process. Lett. 33(3): 141-143 (1989) - Ravi B. Boppana:
The Average-Case Parallel Complexity of Sorting. Inf. Process. Lett. 33(3): 145-146 (1989) - Jayaramaiah Boreddy, R. N. Mukherjee:
An Algorithm to Find Polygon Similarity. Inf. Process. Lett. 33(4): 105-206 (1989) - Christian Buchta:
On the Average Number of Maxima in a Set of Vectors. Inf. Process. Lett. 33(2): 63-65 (1989) - Stefano Ceri, Georg Gottlob, Letizia Tanca, Gio Wiederhold:
Magic Semi-Joins. Inf. Process. Lett. 33(2): 97-107 (1989) - Kuo-Liang Chung, Wen-Chin Chen, Ferng-Ching Lin:
Fast Computation of Periodic Continued Fractions. Inf. Process. Lett. 33(2): 67-72 (1989) - Bhaskar DasGupta, C. E. Veni Madhavan:
An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem. Inf. Process. Lett. 33(1): 35-44 (1989) - Martin Dietzfelbinger:
The Speed of Copying on One-Tape Off-Line Turing Machines. Inf. Process. Lett. 33(2): 83-89 (1989)
skipping 27 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 03:44 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