Остановите войну!
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
- 1997
- Eric Aaron, David Gries:
Formal Justification of Underspecification for S5. Inf. Process. Lett. 64(3): 115-121 (1997) - Luca Aceto, Anna Ingólfsdóttir:
A Characterization of Finitary Bisimulation. Inf. Process. Lett. 64(3): 127-134 (1997) - Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
Billiard Quorums on the Grid. Inf. Process. Lett. 64(1): 9-16 (1997) - Susanne Albers, Michael Mitzenmacher:
Revisiting the Counter Algorithms for List Update. Inf. Process. Lett. 64(3): 155-160 (1997) - Laurent Alonso, Jean-Luc Rémy, René Schott:
Uniform Generation of a Schröder Tree. Inf. Process. Lett. 64(6): 305-308 (1997) - Stephen Alstrup, Jens P. Secher, Maz Spork:
Optimal On-Line Decremental Connectivity in Trees. Inf. Process. Lett. 64(4): 161-164 (1997) - André Arnold, Mathias Kanta, Daniel Krob:
Recognizable Subsets of the Two Letter Plactic Monoid. Inf. Process. Lett. 64(2): 53-59 (1997) - Anindo Bagchi:
Route Selection with Multiple Metrics. Inf. Process. Lett. 64(4): 203-205 (1997) - Sanjoy K. Baruah, Johannes Gehrke, C. Greg Plaxton, Ion Stoica, Hussein M. Abdel-Wahab, Kevin Jeffay:
Fair On-Line Scheduling of a Dynamic Set of Tasks on a Single Resource. Inf. Process. Lett. 64(1): 43-51 (1997) - E. Belogay, Carlos Cabrelli, Ursula Molter, Ron Shonkwiler:
Calculating the Hausdorff Distance Between Curves. Inf. Process. Lett. 64(1): 17-22 (1997) - Elisa Bertino, Barbara Catania, Boris Shidlovsky:
Towards Optimal Two-Dimensional Indexing for Constraint Databases. Inf. Process. Lett. 64(1): 1-8 (1997) - Paolo Boldi, Sebastiano Vigna:
Minimal Sense of Direction and Decision Problems for Cayley Graphs. Inf. Process. Lett. 64(6): 299-303 (1997) - Marco Cesati, Luca Trevisan:
On the Efficiency of Polynomial Time Approximation Schemes. Inf. Process. Lett. 64(4): 165-171 (1997) - Hung-Yi Chang, Rong-Jaye Chen:
Embedding Cycles in IEH Graphs. Inf. Process. Lett. 64(1): 23-27 (1997) - Ye-In Chang, Bi-Yen Yang:
Efficient Access Methods for Image Databases. Inf. Process. Lett. 64(2): 95-105 (1997) - Edward G. Coffman Jr., Leopold Flatto, Edgar N. Gilbert, Albert G. Greenberg:
An Approximate Model of Processor Communication Rings Under Heavy Load. Inf. Process. Lett. 64(2): 61-67 (1997) - Laurent Coupry:
A Simple Linear Algorithm for the Edge-Disjoint (s, t)-Paths Problem in Undirected Planar Graphs. Inf. Process. Lett. 64(2): 83-86 (1997) - Yang Dai, Kazuo Iwano, Naoki Katoh:
A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems. Inf. Process. Lett. 64(5): 255-261 (1997) - Frank K. H. A. Dehne, Katia S. Guimarães:
Exact and Approximate Computational Geometry Solutions of an Unrestricted Point Set Stereo Matching Problem. Inf. Process. Lett. 64(3): 107-114 (1997) - Carlos Domingo, Tatsuie Tsukiji, Osamu Watanabe:
Partial Occam's Razor and its Applications. Inf. Process. Lett. 64(4): 179-185 (1997) - Abbas Edalat, David W. N. Sharp, Lyndon While:
Bounding the Attractor of an IFS. Inf. Process. Lett. 64(4): 197-202 (1997) - Alon Efrat, Otfried Schwarzkopf:
Separating and Shattering Long Line Segments. Inf. Process. Lett. 64(6): 309-314 (1997) - Marianne Flouret, Éric Laugerotte:
Noncommutative Minimization Algorithms. Inf. Process. Lett. 64(3): 123-126 (1997) - Jovan Dj. Golic, Mahmoud Salmasizadeh, Leonie Simpson, Ed Dawson:
Fast Correlation Attacks on Nonlinear Filter Generators. Inf. Process. Lett. 64(1): 37-42 (1997) - Thomas Graf, V. Kamakoti:
Sparse Dominance Queries for Many Points in Optimal Time and Space. Inf. Process. Lett. 64(6): 287-291 (1997) - Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid:
A Technique for Adding Range Restrictions to Generalized Searching Problems. Inf. Process. Lett. 64(5): 263-269 (1997) - Kouichi Hirata:
Constructing Simply Recursive Programs from a Finite Set of Good Examples. Inf. Process. Lett. 64(5): 225-230 (1997) - Vikram Iyengar, Krishnendu Chakrabarty:
An Efficient Finite-State Machine Implementation of Huffman Decoders. Inf. Process. Lett. 64(6): 271-275 (1997) - Santosh N. Kabadi, Yash P. Aneja:
An Efficient, Strongly Polynomial, epsilon-Approximation Schemes. Inf. Process. Lett. 64(4): 173-177 (1997) - Mikhail Y. Kovalyov, Yakov M. Shafransky:
Batch Scheduling with Deadlines on Parallel Machines: An NP-Hard Case. Inf. Process. Lett. 64(2): 69-74 (1997)
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-06-04 08:07 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