![](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 86 matches
- 2008
- Luca Aceto, Silvio Capobianco
, Anna Ingólfsdóttir, Bas Luttik:
The equational theory of prebisimilarity over basic CCS with divergence. Inf. Process. Lett. 108(5): 284-289 (2008) - Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings. Inf. Process. Lett. 108(6): 360-364 (2008) - Bishnu Bhattacharyya, Frank K. H. A. Dehne:
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees. Inf. Process. Lett. 108(5): 293-297 (2008) - Yohan Boichut, Pierre-Cyrille Héam:
A theoretical limit for safety verification techniques with regular fix-point computations. Inf. Process. Lett. 108(1): 1-2 (2008) - Rajesh Bordawekar, Oded Shmueli:
An algorithm for partitioning trees augmented with sibling edges. Inf. Process. Lett. 108(3): 136-142 (2008) - Henning Bordihn, Markus Holzer
:
A note on cooperating distributed grammar systems working in combined modes. Inf. Process. Lett. 108(1): 10-14 (2008) - Prosenjit Bose
, Hua Guo, Evangelos Kranakis
, Anil Maheshwari, Pat Morin
, Jason Morrison
, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. Inf. Process. Lett. 108(4): 210-213 (2008) - Julia Böttcher
, Dan Vilenchik:
On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108(3): 143-149 (2008) - Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit
:
Space efficient and time optimal distributed BFS tree construction. Inf. Process. Lett. 108(5): 273-278 (2008) - Fokko J. van de Bult, Gerhard J. Woeginger:
The problem of the moody chess players. Inf. Process. Lett. 108(5): 336-337 (2008) - Ricardo dos Santos Carvalho, Carlile Lavor
, Fábio Protti:
Extending the geometric build-up algorithm for the molecular distance geometry problem. Inf. Process. Lett. 108(4): 234-237 (2008) - Pierre Charbit
, Michel Habib
, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A note on computing set overlap classes. Inf. Process. Lett. 108(4): 186-191 (2008) - Reuven Cohen, Liran Katzir
:
The Generalized Maximum Coverage Problem. Inf. Process. Lett. 108(1): 15-22 (2008) - Maxime Crochemore
, Costas S. Iliopoulos, Mohammad Sohel Rahman:
Optimal prefix and suffix queries on texts. Inf. Process. Lett. 108(5): 320-325 (2008) - Sebastian Czerwinski, Jaroslaw Grytczuk
:
Invisible runners in finite fields. Inf. Process. Lett. 108(2): 64-67 (2008) - Xiaotie Deng
, Ye Du:
The computation of approximate competitive equilibrium is PPAD-hard. Inf. Process. Lett. 108(6): 369-373 (2008) - Razvan Diaconescu:
A categorical study on the finiteness of specifications. Inf. Process. Lett. 108(2): 75-80 (2008) - Qiang Dong
, Xiaofan Yang, Juan Zhao:
Embedding a family of disjoint multi-dimensional meshes into a crossed cube. Inf. Process. Lett. 108(6): 394-397 (2008) - Mitre Costa Dourado, Min Chih Lin
, Fábio Protti, Jayme Luiz Szwarcfiter:
Improved algorithms for recognizing p. Inf. Process. Lett. 108(4): 247-250 (2008) - Rod Downey, Noam Greenberg:
Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5): 298-303 (2008) - Manfred Droste, Jacques Sakarovitch, Heiko Vogler:
Weighted automata with discounting. Inf. Process. Lett. 108(1): 23-28 (2008) - Louis Esperet
, Arnaud Labourel, Pascal Ochem:
On induced-universal graphs for the class of bounded-degree graphs. Inf. Process. Lett. 108(5): 255-260 (2008) - Anna Fiedorowicz
, Mariusz Haluszczak, Narayanan Narayanan
:
About acyclic edge colourings of planar graphs. Inf. Process. Lett. 108(6): 412-417 (2008) - Jung-Sheng Fu:
Fault-free cycles in folded hypercubes with more faulty elements. Inf. Process. Lett. 108(5): 261-263 (2008) - Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa:
Online chasing problems for regular polygons. Inf. Process. Lett. 108(3): 155-159 (2008) - Stanley P. Y. Fung:
Lower bounds on online deadline scheduling with preemption penalties. Inf. Process. Lett. 108(4): 214-218 (2008) - Travis Gagie
:
Dynamic asymmetric communication. Inf. Process. Lett. 108(6): 352-355 (2008) - Travis Gagie
:
Sorting streamed multisets. Inf. Process. Lett. 108(6): 418-421 (2008) - David Galindo
, Javier Herranz
:
On the security of public key cryptosystems with a double decryption mechanism. Inf. Process. Lett. 108(5): 279-283 (2008) - Stefan Göller:
Reachability on prefix-recognizable graphs. Inf. Process. Lett. 108(2): 71-74 (2008)
skipping 56 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 15:22 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