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 52 matches
- 1982
- José L. Balcázar, Josep Díaz:
A Note on a Theorem by Ladner. Inf. Process. Lett. 15(2): 84-86 (1982) - Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter:
A Probabilistic Algorithm for Vertex Connectivity of Graphs. Inf. Process. Lett. 15(3): 135-136 (1982) - Jan A. Bergstra, John V. Tucker:
Two Theorems About the Completeness of Hoare's Logic. Inf. Process. Lett. 15(4): 143-149 (1982) - Jean-Claude Bermond, Charles Delorme, Jean-Jacques Quisquater:
Tables of Large Graphs with Given Degree and Diameter. Inf. Process. Lett. 15(1): 10-13 (1982) - Coenraad Bron, E. J. Dijkstra, S. Doaitse Swierstra:
A Memory-Management Unit for the Optimal Exploitation of a Small Address Space. Inf. Process. Lett. 15(1): 20-22 (1982) - Stefano Ceri, Giuseppe Pelagatti:
A Solution Method for the Non-Additive Resource Allocation Problem in Distributed System Design. Inf. Process. Lett. 15(4): 174-178 (1982) - To-Yat Cheung:
A Statistical Model for Estimating the Number of Records in a Relational Database. Inf. Process. Lett. 15(3): 115-118 (1982) - Karel Culík II, Derick Wood:
A Note on Some Tree Similarity Measures. Inf. Process. Lett. 15(1): 39-42 (1982) - Edsger W. Dijkstra, A. J. M. van Gasteren:
An Introduction to Three Algorithms for Sorting in Situ. Inf. Process. Lett. 15(3): 129-134 (1982) - Caroline M. Eastman, Maria Zemankova:
Partially Specified Nearest Neighbor Searches Using k-d Trees. Inf. Process. Lett. 15(2): 53-56 (1982) - Arthur M. Farley, Andrzej Proskurowski:
Directed Maximal-Cut Problems. Inf. Process. Lett. 15(5): 238-241 (1982) - L. Goh, Doron Rotem:
Recognition of Perfect Elimination Bipartite Graphs. Inf. Process. Lett. 15(4): 179-182 (1982) - Allen Goldberg, Paul Walton Purdom Jr., Cynthia A. Brown:
Average Time Analyses of Simplified Davis-Putnam Procedures. Inf. Process. Lett. 15(2): 72-75 (1982) - Teofilo F. Gonzalez, Donald B. Johnson:
Sorting Numbers in Linear Expected Time and Optimal Extra Space. Inf. Process. Lett. 15(3): 119-124 (1982) - Albert G. Greenberg, Richard E. Ladner, Mike Paterson, Zvi Galil:
Efficient Parallel Algorithms for Linear Recurrence Computation. Inf. Process. Lett. 15(1): 31-35 (1982) - Peter T. Highnam:
The Aars of a Polygon. Inf. Process. Lett. 15(5): 196-198 (1982) - Mamoru Hoshi, Toshitsugu Yuba:
A Counter Example to a Monotonicity Property of k-d Trees. Inf. Process. Lett. 15(4): 169-173 (1982) - Hiroshi Imai:
Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane. Inf. Process. Lett. 15(3): 125-128 (1982) - Katsushi Inoue, Itsuo Takanami, Hiroshi Taniguchi:
A Note on Alternating On-Line Turing Machines. Inf. Process. Lett. 15(4): 164-168 (1982) - Jean-Pierre Jouannaud, Pierre Lescanne:
On Multiset Orderings. Inf. Process. Lett. 15(2): 57-63 (1982) - Waldemar Korczynski, Józef Winkowski:
A Communication Concept for Distributed Systems. Inf. Process. Lett. 15(3): 111-114 (1982) - Timo Leipälä:
On Optimal Multilevel Indexed Sequential Files. Inf. Process. Lett. 15(5): 191-195 (1982) - Clement H. C. Leung:
Optimal Database Reorganisation: Some Practical Difficulties. Inf. Process. Lett. 15(1): 23-27 (1982) - Leon S. Levy:
An Improved List-Searching Algorithm. Inf. Process. Lett. 15(1): 43-45 (1982) - Harry R. Lewis, Richard Statman:
Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15(5): 220-222 (1982) - Fabrizio Luccio, Linda Pagli:
A Linear Algorithm to Determine Minimal Spanning Forests in Chain Graphs. Inf. Process. Lett. 15(1): 1-4 (1982) - George S. Lueker, Dan E. Willard:
A Data Structure for Dynamic Range Queries. Inf. Process. Lett. 15(5): 209-213 (1982) - Leon Lukaszewicz:
Universal Grammars. Inf. Process. Lett. 15(2): 76-80 (1982) - Michael G. Main:
Permutations Are Not Context-Free: An Application of the Interchange Lemma. Inf. Process. Lett. 15(2): 68-71 (1982) - Glenn K. Manacher:
Steady-Paced-Output and Fractional-On-Line Algorithms on a RAM. Inf. Process. Lett. 15(2): 47-52 (1982)
skipping 22 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-02 10:34 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