![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
- 1993
- Nancy M. Amato:
Improved Processor Bounds for Parallel Algorithms for Weighted Directed Graphs. Inf. Process. Lett. 45(3): 147-152 (1993) - Anastasia Analyti, Sakti Pramanik:
Performance Analysis of a Main Memory Multi-Directory Hashing Technique. Inf. Process. Lett. 45(4): 191-197 (1993) - Ricardo A. Baeza-Yates
, Mireille Régnier:
Fast Two-Dimensional Pattern Matching. Inf. Process. Lett. 45(1): 51-57 (1993) - Marshall W. Bern:
Approximate Closest-Point Queries in High Dimensions. Inf. Process. Lett. 45(2): 95-99 (1993) - A. Bijlsma:
Quasi-Boolean Equivalence. Inf. Process. Lett. 45(5): 243-247 (1993) - Michael Buro:
On the Maximum Length of Huffman Codes. Inf. Process. Lett. 45(5): 219-223 (1993) - Leizhen Cai:
The Recognition of Union Trees. Inf. Process. Lett. 45(6): 279-283 (1993) - Wen-Tsuen Chen, Kuen-Rong Hsieh:
A Neural Sorting Network with O(1) Time Complexity. Inf. Process. Lett. 45(6): 309-313 (1993) - Cheng-Chia Chen, I-Peng Lin:
The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic. Inf. Process. Lett. 45(3): 131-136 (1993) - Steven Cheung, Francis C. M. Lau:
A Lower Bound for Permutation Routing on Two-Dimensional Bused Meshes. Inf. Process. Lett. 45(5): 225-228 (1993) - Andrew Chin:
Permutations on the Block PRAM. Inf. Process. Lett. 45(2): 69-73 (1993) - Benny Chor, Eyal Kushilevitz:
A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45(4): 205-210 (1993) - David Cross, Reinhard Drefenstedt, Jörg Keller:
Reduction of Network Cost and Wiring in Ranade's Butterfly Routing. Inf. Process. Lett. 45(2): 63-67 (1993) - Khaled Day
, Anand R. Tripathi:
Unidirectional Star Graphs. Inf. Process. Lett. 45(3): 123-129 (1993) - Matthew Dickerson, Jason Shugart:
A Simple Algorithm for Enumerating Longest Distances in the Plane. Inf. Process. Lett. 45(5): 269-274 (1993) - John F. Dillenburg, Peter C. Nelson:
Improving the Efficiency of Depth-First Search by Cycle Elimination. Inf. Process. Lett. 45(1): 5-10 (1993) - Frank Drewes:
NP-Completeness of k-Connected Hyperedge-Replacement Languages of Order k. Inf. Process. Lett. 45(2): 89-94 (1993) - Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld:
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. Inf. Process. Lett. 45(2): 101-105 (1993) - Vincent A. Fischetti, Gad M. Landau, Peter H. Sellers, Jeanette P. Schmidt:
Identifying Periodic Occurrences of a Template with Applications to Protein Structure. Inf. Process. Lett. 45(1): 11-18 (1993) - James A. Foster
:
The Generic Oracle Hypothesis is False. Inf. Process. Lett. 45(2): 59-62 (1993) - Luisa Gargano
, Ugo Vaccaro, A. Vozella:
Fault Tolerant Routing in the Star and Pancake Interconnection Networks. Inf. Process. Lett. 45(6): 315-320 (1993) - Fanica Gavril:
An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible. Inf. Process. Lett. 45(6): 285-290 (1993) - Magnús M. Halldórsson:
A Still Better Performance Guarantee for Approximate Graph Coloring. Inf. Process. Lett. 45(1): 19-23 (1993) - Philipp Hanschke, Jörg Würtz:
Satisfiability of the Smallest Binary Program. Inf. Process. Lett. 45(5): 237-241 (1993) - Suchen H. Hsu, Richard T. Snodgrass:
Optimal Block Size for Set-Valued Attributes. Inf. Process. Lett. 45(3): 153-158 (1993) - Edmund Ihler, Dorothea Wagner, Frank Wagner:
Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993) - Bin Jiang:
I/O-and CPU-Optimal Recognition of Strongly Connected Components. Inf. Process. Lett. 45(3): 111-115 (1993) - Jifeng He, C. A. R. Hoare:
From Algebra to Operational Semantics. Inf. Process. Lett. 45(2): 75-80 (1993) - Jeong Uk Kim, Ho-Chang, Tag Gon Kim:
Multidisk Partial Match File Design with Known Access Pattern. Inf. Process. Lett. 45(1): 33-39 (1993) - Tracy Kimbrel, Rakesh K. Sinha:
A Probabilistic Algorithm for Verifying Matrix Products Using O(n²) Time and log_2 n + O(1) Random Bits. Inf. Process. Lett. 45(2): 107-110 (1993)
skipping 22 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-25 00:21 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