Остановите войну!
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 63 matches
- 1995
- Richa Agarwala, David Fernández-Baca:
Weighted Search in the Plane. Inf. Process. Lett. 54(2): 97-100 (1995) - Noga Alon, Yishay Mansour:
epsilon-Discrepancy Sets and Their Application for Interpolation of Sparse Polynomials. Inf. Process. Lett. 54(6): 337-342 (1995) - Guillermo A. Alvarez, Marcelo O. Fernández:
Efficient Management of Multiple Outstanding Timeouts. Inf. Process. Lett. 54(3): 139-145 (1995) - Giorgio Ausiello, Marco Protasi:
Local Search, Reducibility and Approximability of NP-Optimization Problems. Inf. Process. Lett. 54(2): 73-79 (1995) - Luis Barriga, Rassul Ayani:
Lazy Update: An Efficient Implementation of LRU Stacks. Inf. Process. Lett. 54(2): 81-84 (1995) - Ferruccio Barsi:
Decoding Residue Codes. Inf. Process. Lett. 54(4): 213-222 (1995) - Aart Blokhuis, Ton Kloks:
On the Equivalence Covering Number of Splitgraphs. Inf. Process. Lett. 54(5): 301-304 (1995) - Ralph P. Boland, Jorge Urrutia:
Corrigendum: Separating Collections of Points in Euclidean Spaces. Inf. Process. Lett. 54(6): 359 (1995) - Horst Bunke, János Csirik:
An Improved Algorithm for Computing the Edit Distance of Run-Length Coded Strings. Inf. Process. Lett. 54(2): 93-96 (1995) - Chui-Cheng Chen, Rong-Jaye Chen:
Compact Embedding of Binary Trees Into Hyperacubes. Inf. Process. Lett. 54(2): 69-72 (1995) - David Maxwell Chickering, Dan Geiger, David Heckerman:
On Finding a Cycle Basis with a Shortest Maximal Cycle. Inf. Process. Lett. 54(1): 55-58 (1995) - Marek Chrobak, T. H. Payne:
A Linear-Time Algorithm for Drawing a Planar Graph on a Grid. Inf. Process. Lett. 54(4): 241-246 (1995) - Israel Cidon, Yuval Shavitt:
Message Terminating Algorithms for Anonymous Rings of Unknown Size. Inf. Process. Lett. 54(2): 111-119 (1995) - Derek G. Corneil, Stephan Olariu, Lorna Stewart:
A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph. Inf. Process. Lett. 54(5): 253-257 (1995) - Stéphane Demri:
3-SAT=SAT for a Class of Normal Modal Logics. Inf. Process. Lett. 54(5): 281-287 (1995) - Jörg Desel, Ekkart Kindler, Tobias Vesper, Rolf Walter:
A Simplified Proof for a Self-Stabilizing Protocol: A Game of Cards. Inf. Process. Lett. 54(6): 327-328 (1995) - Guozhu Dong:
On the Index of Positive Programmed Formal Languages. Inf. Process. Lett. 54(2): 105-110 (1995) - Paul E. Dunne, Chris J. Gittings, Paul H. Leng:
Multiprocessor Simulation Strategies with Optimal Speed-up. Inf. Process. Lett. 54(1): 23-33 (1995) - Henning Fernau:
A Note on Uniformly Limited ETOL Systems with Unique Interpretation. Inf. Process. Lett. 54(4): 199-204 (1995) - Eddy Fromentin, Claude Jard, Guy-Vincent Jourdan, Michel Raynal:
On-The-Fly Analysis of Distributed Computations. Inf. Process. Lett. 54(5): 267-274 (1995) - Satoshi Fujita:
A Note on the Size of a Multicast Tree in Hypercubes. Inf. Process. Lett. 54(4): 223-227 (1995) - Akihiro Fujiwara, Toshimitsu Masuzawa, Hideo Fujiwara:
An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2-D Binary Images. Inf. Process. Lett. 54(5): 295-300 (1995) - Stanislaw Gawiejnowicz, Lidia Pankowska:
Scheduling Jobs with Varying Processing Times. Inf. Process. Lett. 54(3): 175-178 (1995) - Massimiliano Goldwurm:
Random Generation of Words in an Algebraic Language in Linear Binary Space. Inf. Process. Lett. 54(4): 229-233 (1995) - Teofilo F. Gonzalez:
A Simple LP-Free Approximation Algorithm for the Minimum Weight Vertex Cover Problem. Inf. Process. Lett. 54(3): 129-131 (1995) - Jean-Jacques Hébrard:
Unique Horn Renaming an Unique 2-Satisfiability. Inf. Process. Lett. 54(4): 235-239 (1995) - Ted Herman, Sukumar Ghosh:
Stabilizing Phase-Clocks. Inf. Process. Lett. 54(5): 259-265 (1995) - Kazuo Iwama, Toniann Pitassi:
Exponential Lower Bounds for the Tree-Like Hajós Calculus. Inf. Process. Lett. 54(5): 289-294 (1995) - Ravi Jain, John Werth:
Analysis of Approximate Algorithms for Edge-Coloring Bipartite Graphs. Inf. Process. Lett. 54(3): 163-168 (1995) - Birgit Jenner:
Knapsack Problems for NL. Inf. Process. Lett. 54(3): 169-174 (1995)
skipping 33 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-06-03 21:30 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