Остановите войну!
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 54 matches
- 2002
- Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002) - Alberto Apostolico, Stefano Lonardi:
A speed-up for the commute between subword trees and DAWGs. Inf. Process. Lett. 83(3): 159-161 (2002) - Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell:
Edit distance of run-length encoded strings. Inf. Process. Lett. 83(6): 307-314 (2002) - Claudio Arbib, Alberto Caprara:
On the stability number of the edge intersection of two graphs. Inf. Process. Lett. 83(3): 173-174 (2002) - Boris Aronov:
A lower bound on Voronoi diagram complexity. Inf. Process. Lett. 83(4): 183-185 (2002) - Paul C. Attie:
Wait-free Byzantine consensus. Inf. Process. Lett. 83(4): 221-227 (2002) - Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger:
Lower bounds on precedence-constrained scheduling for parallel processors. Inf. Process. Lett. 83(1): 27-32 (2002) - Ricardo A. Baeza-Yates, Hector Soza-Pollman:
Optimal bounded disorder. Inf. Process. Lett. 83(3): 151-157 (2002) - Roberto Barbuti, Cinzia Bernardeschi, Nicoletta De Francesco:
Abstract interpretation of operational semantics for secure information flow. Inf. Process. Lett. 83(2): 101-108 (2002) - Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
New bounds on the size of the minimum feedback vertex set in meshes and butterflies. Inf. Process. Lett. 83(5): 275-280 (2002) - Bruno Carpentieri:
Sending compressed messages to a learned receiver on a bidirectional line. Inf. Process. Lett. 83(2): 63-70 (2002) - Byeong-Mo Chang:
Managing the granularity of constraint-based analyses by rule transformation. Inf. Process. Lett. 83(2): 79-88 (2002) - Gerard J. Chang:
Corrigendum to "The path-partition problem in block graphs". Inf. Process. Lett. 83(5): 293 (2002) - Sheng-Tzong Cheng, Ing-Ray Chen:
A self-adjusting quality of service control scheme. Inf. Process. Lett. 83(6): 337-344 (2002) - L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem:
Walking around fat obstacles. Inf. Process. Lett. 83(3): 135-140 (2002) - Francis Y. L. Chin, Fu Lee Wang:
Efficient algorithm for transversal of disjoint convex polygons. Inf. Process. Lett. 83(3): 141-144 (2002) - Haengrae Cho:
Database recovery using incomplete page versions in a multisystem data sharing environment. Inf. Process. Lett. 83(1): 49-55 (2002) - Funda Ergün, Rakesh K. Sinha, Lisa Zhang:
An improved FPTAS for Restricted Shortest Path. Inf. Process. Lett. 83(5): 287-291 (2002) - Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
Bundle event structures: A revised cpo approach. Inf. Process. Lett. 83(1): 7-12 (2002) - Fedor V. Fomin, Andrzej Lingas:
Approximation algorithms for time-dependent orienteering. Inf. Process. Lett. 83(2): 57-62 (2002) - Jean-Luc Fouquet:
No odd pairs in minimal imperfect NP5 graphs. Inf. Process. Lett. 83(4): 201-204 (2002) - Steven D. Galbraith, John Malone-Lee, Nigel P. Smart:
Public key signatures in the multi-user setting. Inf. Process. Lett. 83(5): 263-266 (2002) - Leszek Gasieniec, Andrzej Lingas:
On adaptive deterministic gossiping in ad hoc radio networks. Inf. Process. Lett. 83(2): 89-93 (2002) - Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83(4): 195-200 (2002) - Mohammad Taghi Hajiaghayi, Yashar Ganjali:
A note on the Consecutive Ones Submatrix problem. Inf. Process. Lett. 83(3): 163-166 (2002) - Wei-Hua He:
Weaknesses in some multisignature schemes for specified group of verifiers. Inf. Process. Lett. 83(2): 95-99 (2002) - Alan J. Hoffman, Kate Jenkins, Tim Roughgarden:
On a game in directed graphs. Inf. Process. Lett. 83(1): 13-16 (2002) - John D. Holt, Soon Myoung Chung:
Mining association rules using inverted hashing and pruning. Inf. Process. Lett. 83(4): 211-220 (2002) - Mikhail Y. Kovalyov, Marcus Pattloch, Günter Schmidt:
A polynomial algorithm for lot-size scheduling of two type tasks. Inf. Process. Lett. 83(4): 229-235 (2002) - Eduardo Sany Laber, Leonardo Gomes Holanda:
Improved bounds for asymmetric communication protocols. Inf. Process. Lett. 83(4): 205-209 (2002)
skipping 24 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 19:22 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