Остановите войну!
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 46 matches
- 2000
- Andris Ambainis:
How rich is the structure of the intrinsic complexity of learning. Inf. Process. Lett. 75(3): 109-112 (2000) - Béatrice Bérard, Catherine Dufourd:
Timed automata and additive clock constraints. Inf. Process. Lett. 75(1-2): 1-7 (2000) - Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000) - Carlo Blundo, Alfredo De Santis, Moni Naor:
Visual cryptography for grey level images. Inf. Process. Lett. 75(6): 255-259 (2000) - Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger:
Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3): 133-138 (2000) - Paolo Boldi, Sebastiano Vigna:
Coverings that preserve sense of direction. Inf. Process. Lett. 75(4): 175-180 (2000) - P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan:
A new universal and fault-tolerant quantum basis. Inf. Process. Lett. 75(3): 101-107 (2000) - Gerth Stølting Brodal, Srinivasan Venkatesh:
Improved bounds for dictionary look-up with one error. Inf. Process. Lett. 75(1-2): 57-59 (2000) - Keh-Ning Chang, Shi-Chun Tsai:
Exact solution of a minimal recurrence. Inf. Process. Lett. 75(1-2): 61-64 (2000) - Ing-Ray Chen, Ding-Chau Wang, Chih-Ping Chu:
Response time behavior of distributed voting algorithms for managing replicated data. Inf. Process. Lett. 75(6): 247-253 (2000) - Marek Chrobak, Jirí Sgall:
A simple analysis of the harmonic algorithm for two servers. Inf. Process. Lett. 75(1-2): 75-77 (2000) - Charles J. Colbourn, Alan C. H. Ling:
Quorums from difference covers. Inf. Process. Lett. 75(1-2): 9-12 (2000) - Alon Efrat, Matthew J. Katz:
Computing Euclidean bottleneck matchings in higher dimensions. Inf. Process. Lett. 75(4): 169-174 (2000) - John A. Ellis, Tobias Krahn, Hongbing Fan:
Computing the cycles in the perfect shuffle permutation. Inf. Process. Lett. 75(5): 217-224 (2000) - Kousha Etessami:
A note on a question of Peled and Wilke regarding stutter-invariant LTL. Inf. Process. Lett. 75(6): 261-263 (2000) - Ari Freund, Howard J. Karloff:
A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. Inf. Process. Lett. 75(1-2): 43-50 (2000) - Eric Gamess:
plapackJava: Towards an efficient Java interface for high performance parallel linear algebra. Inf. Process. Lett. 75(5): 191-197 (2000) - Krzysztof Giaro, Marek Kubale:
Edge-chromatic sum of trees and bounded cyclicity graphs. Inf. Process. Lett. 75(1-2): 65-69 (2000) - Mayer Goldberg:
Gödelization in the lambda calculus. Inf. Process. Lett. 75(1-2): 13-16 (2000) - Massimiliano Goldwurm, Massimo Santini:
Clique polynomials have a unique root of smallest modulus. Inf. Process. Lett. 75(3): 127-132 (2000) - D. J. Guan, Chun-yen Chou, Chiou-Wei Chen:
Computational complexity of similarity retrieval in a pictorial database. Inf. Process. Lett. 75(3): 113-117 (2000) - Wolfgang Günther, Rolf Drechsler:
On the computational power of linearly transformed BDDs. Inf. Process. Lett. 75(3): 119-125 (2000) - Refael Hassin, Shlomi Rubinstein:
Better approximations for max TSP. Inf. Process. Lett. 75(4): 181-186 (2000) - Toru Hasunuma:
On edge-disjoint spanning trees with small depths. Inf. Process. Lett. 75(1-2): 71-74 (2000) - Ulrich Hertrampf, Steffen Reith, Heribert Vollmer:
A note on closure properties of logspace MOD classes. Inf. Process. Lett. 75(3): 91-93 (2000) - Jacob M. Howe, Andy King:
Abstracting numeric constraints with Boolean functions. Inf. Process. Lett. 75(1-2): 17-23 (2000) - Peter Høyer:
Simplified proof of the Fourier Sampling Theorem. Inf. Process. Lett. 75(4): 139-143 (2000) - Frank K. Hwang, C. K. Pai:
Sequential construction of a circular consecutive-2 system. Inf. Process. Lett. 75(5): 231-235 (2000) - K. V. R. C. N. Kishore, Sanjeev Saxena:
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. Inf. Process. Lett. 75(4): 145-151 (2000) - Ju-Hong Lee, Deok-Hwan Kim, Seok-Lyong Lee, Chin-Wan Chung, Guang-Ho Cha:
Distributed similarity search algorithm in distributed heterogeneous multimedia databases. Inf. Process. Lett. 75(1-2): 35-42 (2000)
skipping 16 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-31 00:54 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