![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 55 matches
- 1998
- Ahmed Ait-Bouziad, Helen Kassel:
An Inproved Algorithm for Retrieving Fuzzy Information from Two Systems. Inf. Process. Lett. 65(2): 63-66 (1998) - Yair Amir, Avishai Wool
:
Optimal Availability Quorum Systems: Theory and Practice. Inf. Process. Lett. 65(5): 223-228 (1998) - Gunnar Andersson, Lars Engebretsen:
Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. Inf. Process. Lett. 65(6): 305-311 (1998) - Sunil Arya, H. Ramesh:
A 2.5-Factor Approximation Algorithm for the k-MST Problem. Inf. Process. Lett. 65(3): 117-118 (1998) - R. Balasubramanian, Michael R. Fellows, Venkatesh Raman:
An Improved Fixed-Parameter Algorithm for Vertex Cover. Inf. Process. Lett. 65(3): 163-168 (1998) - Therese C. Biedl:
Relating Bends and Size in Orthogonal Graph Drawings. Inf. Process. Lett. 65(2): 111-115 (1998) - Carlo Blundo, Alfredo De Santis
, Ugo Vaccaro:
On Secret Sharing Schemes. Inf. Process. Lett. 65(1): 25-32 (1998) - Prosenjit Bose, Jonathan F. Buss, Anna Lubiw:
Pattern Matching for Permutations. Inf. Process. Lett. 65(5): 277-283 (1998) - Nader H. Bshouty, Christino Tamon, David K. Wilson:
On Learning width Two Branching Programs. Inf. Process. Lett. 65(4): 217-222 (1998) - Jou-Ming Chang
, Chin-Wen Ho:
The Recognition of Geodetically Connected Graphs. Inf. Process. Lett. 65(2): 81-88 (1998) - Kaijung Chang, Yan Huat Tan, Yaakov L. Varol, Jiang-Hsing Chu:
A Study on Interleaving Versus Segmentation. Inf. Process. Lett. 65(6): 319-324 (1998) - Yaw-Wen Chang, Chang-Biau Yang:
A Parallel Algorithm for Circulant Tridiagonal Linear Systems. Inf. Process. Lett. 65(6): 331-337 (1998) - Shiva Chaudhuri, Naveen Garg
, R. Ravi:
The p-Neighbor k-Center Problem. Inf. Process. Lett. 65(3): 131-134 (1998) - Wen-Huei Chen:
Test Sequence Generation from the Protocol Data Portion Based on the Selecting Chinese Postman Algorithm. Inf. Process. Lett. 65(5): 261-268 (1998) - Danny Z. Chen, Ovidiu Daescu:
Maintaining Visibility of a Polygon with a Moving Point of View. Inf. Process. Lett. 65(5): 269-275 (1998) - T. C. Edwin Cheng
, Qing Ding:
The Complexity of Scheduling Starting Time Dependent Tasks with Release Times. Inf. Process. Lett. 65(2): 75-79 (1998) - Elias Dahlhaus, Paul D. Manuel
, Mirka Miller:
Maximum h-Colourable Subgraph Problem in Balanced Graphs. Inf. Process. Lett. 65(6): 301-303 (1998) - Pallab Dasgupta:
Agreement under Faulty Interfaces. Inf. Process. Lett. 65(3): 125-129 (1998) - Paolo Dell'Olmo, Hans Kellerer, Maria Grazia Speranza, Zsolt Tuza:
A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins. Inf. Process. Lett. 65(5): 229-233 (1998) - Dimitrios Dervos, Yannis Manolopoulos, Panagiotis Linardis:
Comparison of Signature File Models with Superimposed Coding. Inf. Process. Lett. 65(2): 101-106 (1998) - Anders Dessmark, Oscar Garrido, Andrzej Lingas:
A Note on Parallel Complexity of Maximum f-Matching. Inf. Process. Lett. 65(2): 107-109 (1998) - Luc Devroye:
On the Richness of the Collection of Subtrees in Random Binary Search Trees. Inf. Process. Lett. 65(4): 195-199 (1998) - Paul E. Dunne
, Michele Zito:
An Inproved Upper Bound on the Non-3-Colourability Threshold. Inf. Process. Lett. 65(1): 17-23 (1998) - Jeremy Frank, Ian P. Gent, Toby Walsh:
Asymptotic and Finite Size Parameters for Phase Transitions: Hamiltonian Circuit as a Case Study. Inf. Process. Lett. 65(5): 241-245 (1998) - Peter J. Grabner, Helmut Prodinger:
An Asymptotic Study of a Recursion Occurring in the Analysis of an Algorithm on Broadcast Communication. Inf. Process. Lett. 65(2): 89-93 (1998) - D. J. Guan:
An Optimal Message Routing Algorithm for Double-Loop Networks. Inf. Process. Lett. 65(5): 255-260 (1998) - Edith Hemaspaandra, Jörg Rothe:
Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. Inf. Process. Lett. 65(3): 151-156 (1998) - Philippe Herrmann:
Timed Automata and Recognizability. Inf. Process. Lett. 65(6): 313-318 (1998) - Gwoboa Horng:
An Active Attack on Protocols for Server-Aided RSA Signature Computation. Inf. Process. Lett. 65(2): 71-73 (1998) - Shing-Tsaan Huang, Tzong-Jye Liu:
Four-State Stabilizing Phase Clock for Unidirectional Rings of Odd Size. Inf. Process. Lett. 65(6): 325-329 (1998)
skipping 25 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-06-23 14:45 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