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 58 matches
- 1996
- Sergio De Agostino, James A. Storer:
On-Line Versus Off-Line Computation in Dynamic Text Compression. Inf. Process. Lett. 59(3): 169-174 (1996) - Noga Alon, Phillip G. Bradford, Rudolf Fleischer:
Matching Nuts and Bolts Faster. Inf. Process. Lett. 59(3): 123-127 (1996) - Stephen Alstrup, Jens Clausen, Kristian Jørgensen:
An O(|V|*|E|) Algorithm for Finding Immediate Multiple-Vertex Dominators. Inf. Process. Lett. 59(1): 9-11 (1996) - Muhammad H. Alsuwaiyel:
Finding a Shortest Hamiltonian Path Inside a Simple Polygon. Inf. Process. Lett. 59(4): 207-210 (1996) - Rohan F. M. Aranha, C. Pandu Rangan:
An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 59(3): 145-150 (1996) - G. Athithan, T. Sony Roy:
Hyperspherical Neighbourhoods and Pattern Recognition Using Neural Networks. Inf. Process. Lett. 59(4): 223-228 (1996) - Ricardo A. Baeza-Yates, Luis O. Fuentes:
A Framework to Animate String Algorithms. Inf. Process. Lett. 59(5): 241-244 (1996) - Ricardo A. Baeza-Yates, Chris H. Perleberg:
Fast and Practical Approximate String Matching. Inf. Process. Lett. 59(1): 21-27 (1996) - Christel Baier, Mila E. Majster-Cederbaum:
Denotational Linear Time Semantics and Sequential Composition. Inf. Process. Lett. 59(3): 135-143 (1996) - Antonio Hernández-Barrera:
Algorithms for Deciding the Containment of Polygons. Inf. Process. Lett. 59(5): 261-265 (1996) - Dominique Barth:
Optimal Broadcasting in the Back to Back d-ary Trees. Inf. Process. Lett. 59(2): 85-89 (1996) - Anna Bernasconi:
Sensitivity vs. Block Sensitivity (an Average-Case Study). Inf. Process. Lett. 59(3): 151-157 (1996) - Beate Bollig, Martin Löbbing, Ingo Wegener:
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. Inf. Process. Lett. 59(5): 233-239 (1996) - Bernd Borchert, Antoni Lozano:
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. Inf. Process. Lett. 59(4): 211-215 (1996) - Nader H. Bshouty:
A Subexponential Exact Learning Algorithm for DNF Using Equivalence Queries. Inf. Process. Lett. 59(1): 37-39 (1996) - Soon Myoung Chung, Pyeong S. Mah:
Semantics-Based Transaction Management for Multidatabase Systems. Inf. Process. Lett. 59(2): 109-115 (1996) - Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka:
Parallel Maximum Independent Set in Convex Bipartite Graphs. Inf. Process. Lett. 59(6): 289-294 (1996) - Vladimir G. Deineko, Gerhard J. Woeginger:
The Convex-Hull-and-k-Line Travelling Salesman Problem. Inf. Process. Lett. 59(6): 295-301 (1996) - Brian Dunten, Julie Jones, Jonathan Sorenson:
A Space-Efficient Fast Prime Number Sieve. Inf. Process. Lett. 59(2): 79-84 (1996) - Toshihiro Fujito:
A Note on Approximation of the Vertex Cover and Feedback Vertex Set Problems - Unified Approach. Inf. Process. Lett. 59(2): 59-63 (1996) - Sukumar Ghosh, Arobinda Gupta:
An Exercise in Fault-Containment: Self-Stabilizing Leader Election. Inf. Process. Lett. 59(5): 281-288 (1996) - Ian Glaister, Jeffrey O. Shallit:
A Lower Bound Technique for the Size of Nondeterministic Finite Automata. Inf. Process. Lett. 59(2): 75-77 (1996) - Ursula Goltz, Heike Wehrheim:
Modelling Causality via Action Dependencies in Branching Time Semantics. Inf. Process. Lett. 59(4): 179-184 (1996) - Monika Henzinger, David P. Williamson:
On the Number of Small Cuts in a Graph. Inf. Process. Lett. 59(1): 41-44 (1996) - Ting-Yem Ho, Yue-Li Wang, Ming-Tsan Juan:
A Linear Time Algorithm for Finding all Hinge Vertices of a Permutation Graph. Inf. Process. Lett. 59(2): 103-107 (1996) - Wlodzimierz Holsztynski, Waldemar W. Koczkodaj:
Convergence of Inconsistency Algorithms for the Pairwise Comparisons. Inf. Process. Lett. 59(4): 197-202 (1996) - Paul G. Howard, Jeffrey Scott Vitter:
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding. Inf. Process. Lett. 59(2): 65-73 (1996) - Zoran Ivkovic, Errol L. Lloyd:
A Fundamental Restriction on Fully Dynamic Maintenance of Bin Packing. Inf. Process. Lett. 59(4): 229-232 (1996) - Yu-Chen Kuo, Shing-Tsaan Huang:
A Simple Scheme to Construct k-Coteries with O(sqrt(N)) Uniform Quorum Sizes. Inf. Process. Lett. 59(1): 31-36 (1996) - M. S. Madanlal, G. Venkatesan, C. Pandu Rangan:
Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs. Inf. Process. Lett. 59(2): 97-102 (1996)
skipping 28 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-09-21 15:42 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