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 56 matches
- 1994
- Nakagawa Akinari, Hiroshi Hagiwara:
On the Real-Number Representation with Variable-Length Exponent Field. Inf. Process. Lett. 52(1): 1-6 (1994) - Eric T. Bax:
Algorithms to Count Paths and Cycles. Inf. Process. Lett. 52(5): 249-252 (1994) - Mark de Berg, Marc J. van Kreveld:
Rectilinear Decompositions with Low Stabbing Number. Inf. Process. Lett. 52(4): 215-221 (1994) - Jan A. Bergstra, Gheorghe Stefanescu:
Bisimulation is Two-Way Simulation. Inf. Process. Lett. 52(6): 285-287 (1994) - Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini:
Corrigendum: An Optimal Lower Bound for Nonregular Languages. Inf. Process. Lett. 52(6): 339 (1994) - Subir Bhattacharya, Amitava Bagchi:
A General Framework for Minimax Search in Game Trees. Inf. Process. Lett. 52(6): 295-301 (1994) - Ronald V. Book:
On Collapsing the Polynomial-Time Hierarchy. Inf. Process. Lett. 52(5): 235-237 (1994) - Ravi B. Boppana:
The Decision-Tree Complexity of Element Distinctness. Inf. Process. Lett. 52(6): 329-331 (1994) - Arturo Carpi:
On Repeated Factors in C\infty-Words. Inf. Process. Lett. 52(6): 289-294 (1994) - Zhi-Zhong Chen:
A Parallel Algorithm for Finding a Triconnected Component Separator with an Application. Inf. Process. Lett. 52(5): 265-271 (1994) - Shao Dong Chen, Hong Shen, Rodney W. Topor:
An Efficient Permutation-Based Parallel Range-Join Algorithm on N-Dimensional Torus Computers. Inf. Process. Lett. 52(1): 35-38 (1994) - Ernie Cohen:
The Convergence Span of Greedy Load Balancing. Inf. Process. Lett. 52(4): 181-182 (1994) - Luc Devroye, Paul Kruszewski:
A Note on the Horton-Strahler Number for Random Trees. Inf. Process. Lett. 52(3): 155-159 (1994) - Paul F. Dietz, Rajeev Raman:
A Constant Update Time Finger Search Tree. Inf. Process. Lett. 52(3): 147-154 (1994) - Irène Durand, Bruno Salinier:
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof. Inf. Process. Lett. 52(3): 137-145 (1994) - Zbigniew Duszak, Waldemar W. Koczkodaj:
Generalization of a New Definition of Consistency for Pairwise Comparisons. Inf. Process. Lett. 52(5): 273-276 (1994) - Michele Flammini:
On the Learnability of Monotone k \mu-DNF Formulae Under Product Distributions. Inf. Process. Lett. 52(3): 167-173 (1994) - Wan J. Fokkink:
A Complete Equational Axiomatization for Prefix Iteration. Inf. Process. Lett. 52(6): 333-337 (1994) - Giulia Galbiati, Francesco Maffioli, Angelo Morzenti:
A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem. Inf. Process. Lett. 52(1): 45-49 (1994) - Mohamed G. Gouda:
Stabilizing Observers. Inf. Process. Lett. 52(2): 99-103 (1994) - Refael Hassin, Shlomo Lahav:
Maximizing the Number of Unused Colors in the Vertex Coloring Problem. Inf. Process. Lett. 52(2): 87-90 (1994) - Chuzo Iwamoto, Godfried T. Toussaint:
Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete. Inf. Process. Lett. 52(4): 183-189 (1994) - Pierre Kelsen:
An Optimal Parallel Algorithm for Maximal Matching. Inf. Process. Lett. 52(4): 223-228 (1994) - Md. Mozammel Huq Azad Khan:
An Algorithm for Hazard-Free Minimization of Incompletely Specified Switching Function. Inf. Process. Lett. 52(1): 23-29 (1994) - Samir Khuller, Uzi Vishkin:
On the Parallel Complexity of Digraph Reachability. Inf. Process. Lett. 52(5): 239-241 (1994) - Philip N. Klein:
A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm. Inf. Process. Lett. 52(6): 303-307 (1994) - Jon M. Kleinberg:
A Lower Bound for Two-Server Balancing Algorithms. Inf. Process. Lett. 52(1): 39-43 (1994) - James F. Korsh:
Loopless Generation of k-Ary Tree Sequences. Inf. Process. Lett. 52(5): 243-247 (1994) - Lawrence L. Larmore, Wojciech Rytter:
An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems. Inf. Process. Lett. 52(1): 31-34 (1994) - Su-Hyun Lee, Do-Hyung Kim, Kwang-Moo Choe:
Path for AND-Parallel Execution of Logic Programs. Inf. Process. Lett. 52(4): 191-199 (1994)
skipping 26 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-10-19 21:58 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