![](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 35 matches
- 2000
- David Avis, Luc Devroye:
Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73(3-4): 137-143 (2000) - Amos Beimel
, Eyal Kushilevitz:
Learning unions of high-dimensional boxes over the reals. Inf. Process. Lett. 73(5-6): 213-220 (2000) - Michael A. Bender, Chandra Chekuri:
Performance guarantees for the TSP with a parameterized triangle inequality. Inf. Process. Lett. 73(1-2): 17-21 (2000) - Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. Inf. Process. Lett. 73(3-4): 111-118 (2000) - Jorge Castro, David Guijarro:
PACS, simple-PAC and query learning. Inf. Process. Lett. 73(1-2): 11-16 (2000) - Tzung-Shi Chen:
Task migration in 2D wormhole-routed mesh multicomputers. Inf. Process. Lett. 73(3-4): 103-110 (2000) - Liang Chen, Naoyuki Tokuda:
A note on "Category and measure in complexity classes". Inf. Process. Lett. 73(5-6): 167-168 (2000) - Eddie Cheng
, Marc J. Lipman:
On the Day-Tripathi orientation of the star graphs: Connectivity. Inf. Process. Lett. 73(1-2): 5-10 (2000) - Ferdinando Cicalese, Ugo Vaccaro:
An improved heuristic for "Ulam-Rényi game". Inf. Process. Lett. 73(3-4): 119-124 (2000) - Raymond R. Devillers, Joël Goossens:
Liu and Layland's schedulability test revisited. Inf. Process. Lett. 73(5-6): 157-161 (2000) - Giovanni Dimauro
, Sebastiano Impedovo, Giuseppe Pirlo
, A. Salzo:
RNS architectures for the implementation of the 'diagonal function'. Inf. Process. Lett. 73(5-6): 189-198 (2000) - Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju
, Grzegorz Rozenberg:
Pancyclicity in switching classes. Inf. Process. Lett. 73(5-6): 153-156 (2000) - Uriel Feige, Joe Kilian:
Finding OR in a noisy broadcast network. Inf. Process. Lett. 73(1-2): 69-75 (2000) - Guillaume Fertin
:
Hierarchical broadcast and gossip networks. Inf. Process. Lett. 73(3-4): 131-136 (2000) - Zoltán Fülöp, Sebastian Maneth:
Domains of partial attributed tree transducers. Inf. Process. Lett. 73(5-6): 175-180 (2000) - Giorgio Gambosi, Gaia Nicosia
:
On-line scheduling with setup costs. Inf. Process. Lett. 73(1-2): 61-68 (2000) - Fanica Gavril:
Maximum weight independent sets and cliques in intersection graphs of filaments. Inf. Process. Lett. 73(5-6): 181-188 (2000) - Sukumar Ghosh, Xin He:
Fault-containing self-stabilization using priority scheduling. Inf. Process. Lett. 73(3-4): 145-151 (2000) - Mikael Goldmann, Alexander Russell
, Denis Thérien:
An ergodic theorem for read-once non-uniform deterministic finite automata. Inf. Process. Lett. 73(1-2): 23-28 (2000) - Ted Herman, Sriram V. Pemmaraju:
Error-detecting codes and fault-containing self-stabilization. Inf. Process. Lett. 73(1-2): 41-46 (2000) - Min-Shiang Hwang:
Cryptanalysis of YCN key assignment scheme in a hierarchy. Inf. Process. Lett. 73(3-4): 97-101 (2000) - Atsushi Kaneko, Kiyoshi Yoshimoto:
On spanning trees with restricted degrees. Inf. Process. Lett. 73(5-6): 163-165 (2000) - Sung Kwon Kim, Chan-Su Shin
, Tae-Cheon Yang:
Placing two disks in a convex polygon. Inf. Process. Lett. 73(1-2): 33-39 (2000) - Erkki Mäkinen
:
On inferring linear single-tree languages. Inf. Process. Lett. 73(1-2): 1-3 (2000) - Steven McKellar, Robert Davis:
Redundancy removal in multicast protocols. Inf. Process. Lett. 73(5-6): 169-173 (2000) - Achour Mostéfaoui, Michel Raynal, Frederic Tronel
:
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. Inf. Process. Lett. 73(5-6): 207-212 (2000) - Amiya Nayak
, Jiajun Ren, Nicola Santoro
:
An improved testing scheme for catastrophic fault patterns. Inf. Process. Lett. 73(5-6): 199-206 (2000) - Rolf Niedermeier, Peter Rossmanith:
A general method to speed up fixed-parameter-tractable algorithms. Inf. Process. Lett. 73(3-4): 125-129 (2000) - Enno Ohlebusch:
A uniform framework for term and graph rewriting applied to combined systems. Inf. Process. Lett. 73(1-2): 53-59 (2000) - Jean Marcel Pallo:
An efficient upper bound of the rotation distance of binary trees. Inf. Process. Lett. 73(3-4): 87-92 (2000)
skipping 5 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-06-30 02:23 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