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
- 1984
- Giuseppe Alia, Ferruccio Barsi, Enrico Martinelli:
A Fast VLSI Conversion Between Binary and Residue Systems. Inf. Process. Lett. 18(3): 141-145 (1984) - Donald C. S. Allison, Mark T. Noga:
The L1 Travelling Salesman Problem. Inf. Process. Lett. 18(4): 195-199 (1984) - Alberto Apostolico, Raffaele Giancarlo:
Pattern Matching Machine Implementation of a Fast Test for Unique Decipherability. Inf. Process. Lett. 18(3): 155-158 (1984) - Mikhail J. Atallah:
Parallel Strong Orientation of an Undirected Graph. Inf. Process. Lett. 18(1): 37-39 (1984) - Paolo Atzeni, Nicola M. Morfuni:
Functional Dependencies in Relations with Null Values. Inf. Process. Lett. 18(4): 233-238 (1984) - Gerhard Barth:
An Analytical Comparison of Two String Search Algorithms. Inf. Process. Lett. 18(5): 249-256 (1984) - Stuart J. Berkowitz:
On Computing the Determinant in Small Parallel Time Using a Small Number of Processors. Inf. Process. Lett. 18(3): 147-150 (1984) - Eike Best:
Fairness and Conspiracies. Inf. Process. Lett. 18(4): 215-220 (1984) - Jacek Blazewicz, Jan Weglarz, Mieczyslaw Drabowski:
Scheduling Independent 2-Processor Tasks to Minimize Schedule Length. Inf. Process. Lett. 18(5): 267-273 (1984) - Francis Y. L. Chin, Cao An Wang:
Minimum Vertex Distance Between Separable Convex Polygons. Inf. Process. Lett. 18(1): 41-45 (1984) - Gianna Cioni, Antoni Kreczmar:
Programmed Deallocation Without Dangling Reference. Inf. Process. Lett. 18(4): 179-187 (1984) - Gordon V. Cormack, R. Nigel Horspool:
Algorithms for Adaptive Huffman Codes. Inf. Process. Lett. 18(3): 159-165 (1984) - Bruno Courcelle:
Some Negative Results Concerning DPDA's. Inf. Process. Lett. 18(5): 285-289 (1984) - Martin E. Dyer, Alan M. Frieze:
A Partitioning Algorithm for Minimum Weighted Euclidean Matching. Inf. Process. Lett. 18(2): 59-62 (1984) - Marie-Paule Flé, Gérard Roucairol:
Multiserialization of Iterated Transactions. Inf. Process. Lett. 18(5): 243-247 (1984) - Donald K. Friesen, Michael A. Langston:
A Storage-Size Selection Problem. Inf. Process. Lett. 18(5): 295-296 (1984) - Robert Geist:
Perception-Based Configuration Design of Computer Systems. Inf. Process. Lett. 18(1): 55-57 (1984) - Nathan Goodman, Y. C. Tay:
A Characterization of Multivalued Dependencies Equivalent to a Join Dependency. Inf. Process. Lett. 18(5): 261-266 (1984) - Leszek Holenderski:
A Note on Specifying and Verifying Concurrent Processes. Inf. Process. Lett. 18(2): 77-85 (1984) - M. Elizabeth C. Hull:
A Parallel View of Stable Marriages. Inf. Process. Lett. 18(2): 63-66 (1984) - Heung-Soon Ihm, Simeon C. Ntafos:
On Legal Path Problems in Digraphs. Inf. Process. Lett. 18(2): 93-98 (1984) - Xiaolong Jin:
Large Processors are Good in VLSI Chips. Inf. Process. Lett. 18(1): 47-49 (1984) - Victor N. Kasyanov:
Loop Cleaning. Inf. Process. Lett. 18(1): 1-6 (1984) - Hirofumi Katsuno:
When Do Non-Conflict-Free Multivalued Dependency Dets Appear? Inf. Process. Lett. 18(2): 87-92 (1984) - Hans-Jörg Kreowski, Grzegorz Rozenberg:
Note on Node-Rewriting Graph Grammars. Inf. Process. Lett. 18(1): 21-24 (1984) - C. C. Lee, D. T. Lee:
On a Circle-Cover Minimization Problem. Inf. Process. Lett. 18(2): 109-115 (1984) - Thomas Lickteig:
A Note on Border Rank. Inf. Process. Lett. 18(3): 173-178 (1984) - Vladimir Lifschitz:
On Verification of Programs With Goto Statements. Inf. Process. Lett. 18(4): 221-225 (1984) - Jan Magott:
Performance Evaluation of Concurrent Systems Using Petri Nets. Inf. Process. Lett. 18(1): 7-13 (1984) - Heikki Mannila, Esko Ukkonen:
A Simple Linear-Time Algorithm for in Situ Merging. Inf. Process. Lett. 18(4): 203-208 (1984)
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-11-24 20:02 CET 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