Остановите войну!
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 47 matches
- 2007
- Ittai Abraham, Gregory V. Chockler, Idit Keidar, Dahlia Malkhi:
Wait-free regular storage from Byzantine components. Inf. Process. Lett. 101(2): 60-65 (2007) - Faisal N. Abu-Khzam, Michael A. Langston:
Linear-time algorithms for problems on planar graphs with fixed disk dimension. Inf. Process. Lett. 101(1): 36-40 (2007) - Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro:
On the longest increasing subsequence of a circular list. Inf. Process. Lett. 101(2): 55-59 (2007) - Houman Alborzi, Hanan Samet:
Execution time analysis of a top-down R-tree construction algorithm. Inf. Process. Lett. 101(1): 6-12 (2007) - Paulo Sérgio Almeida, Carlos Baquero, Nuno M. Preguiça, David Hutchison:
Scalable Bloom Filters. Inf. Process. Lett. 101(6): 255-261 (2007) - Emmanuelle Anceaume, Roy Friedman, Maria Gradinariu:
Managed Agreement: Generalizing two fundamental distributed agreement problems. Inf. Process. Lett. 101(5): 190-198 (2007) - Eric Bach:
Bounds for the expected duration of the monopolist game. Inf. Process. Lett. 101(2): 86-92 (2007) - Richard S. Bird, Stefan Sadnicki:
Minimal on-line labelling. Inf. Process. Lett. 101(1): 41-45 (2007) - Péter Biró, Katarína Cechlárová:
Inapproximability of the kidney exchange problem. Inf. Process. Lett. 101(5): 199-202 (2007) - Wenbin Chen, Jiangtao Meng:
An improved lower bound for approximating Shortest Integer Relation in linfinity norm (SIRinfinity). Inf. Process. Lett. 101(4): 174-179 (2007) - Min Chen, André Raspaud, Weifan Wang:
Three-coloring planar graphs without short cycles. Inf. Process. Lett. 101(3): 134-138 (2007) - Peter Clifford, Raphaël Clifford:
Simple deterministic wildcard matching. Inf. Process. Lett. 101(2): 53-54 (2007) - Michael J. Collins, David Kempe, Jared Saia, Maxwell Young:
Nonnegative integral subset representations of integer sets. Inf. Process. Lett. 101(3): 129-133 (2007) - Martin Dietzfelbinger, Henning Wunderlich:
A characterization of average case communication complexity. Inf. Process. Lett. 101(6): 245-249 (2007) - Yoann Dieudonné, Franck Petit:
Circle formation of weak robots and Lyndon words. Inf. Process. Lett. 101(4): 156-162 (2007) - Maria Patricia Dobson, Marisa Gutierrez, Michel Habib, Jayme Luiz Szwarcfiter:
On transitive orientations with restricted covering graphs. Inf. Process. Lett. 101(3): 119-125 (2007) - David Eisenstat, Dana Angluin:
The VC dimension of k-fold union. Inf. Process. Lett. 101(5): 181-184 (2007) - Joost Engelfriet:
A Kleene characterization of computability. Inf. Process. Lett. 101(4): 139-140 (2007) - Joost Engelfriet, Tjalling Gelsema:
An exercise in structural congruence. Inf. Process. Lett. 101(1): 1-5 (2007) - Katrin Erk, Joachim Niehren:
Dominance constraints in stratified context unification. Inf. Process. Lett. 101(4): 141-147 (2007) - Louis Esperet, Pascal Ochem:
Oriented colorings of 2-outerplanar graphs. Inf. Process. Lett. 101(5): 215-219 (2007) - Uriel Feige, James R. Lee:
An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett. 101(1): 26-29 (2007) - Hong-Chun Hsu, Pao-Lien Lai, Chang-Hsiung Tsai:
Geodesic pancyclicity and balanced pancyclicity of Augmented cubes. Inf. Process. Lett. 101(6): 227-232 (2007) - Shiyan Hu:
A linear time algorithm for max-min length triangulation of a convex polygon. Inf. Process. Lett. 101(5): 203-208 (2007) - Yoshinobu Kawabe, Ken Mano, Hideki Sakurada, Yasuyuki Tsukada:
Theorem-proving anonymity of infinite-state systems. Inf. Process. Lett. 101(1): 46-51 (2007) - Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich:
A global parallel algorithm for the hypergraph transversal problem. Inf. Process. Lett. 101(4): 148-155 (2007) - Jan Krajícek:
Substitutions into propositional tautologies. Inf. Process. Lett. 101(4): 163-167 (2007) - Shuang Luan, Jared Saia, Maxwell Young:
Approximation algorithms for minimizing segments in radiation therapy. Inf. Process. Lett. 101(6): 239-244 (2007) - Moritz G. Maaß:
Computing suffix links for suffix trees and arrays. Inf. Process. Lett. 101(6): 250-254 (2007) - Carlos Martín-Vide, Victor Mitrana:
Remarks on arbitrary multiple pattern interpretations. Inf. Process. Lett. 101(5): 209-214 (2007)
skipping 17 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-06 05:10 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