default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 73
Volume 73, Numbers 1-2, 31 January 2000
- Erkki Mäkinen
:
On inferring linear single-tree languages. 1-3 - Eddie Cheng, Marc J. Lipman:
On the Day-Tripathi orientation of the star graphs: Connectivity. 5-10 - Jorge Castro, David Guijarro:
PACS, simple-PAC and query learning. 11-16 - Michael A. Bender, Chandra Chekuri:
Performance guarantees for the TSP with a parameterized triangle inequality. 17-21 - Mikael Goldmann, Alexander Russell, Denis Thérien:
An ergodic theorem for read-once non-uniform deterministic finite automata. 23-28 - Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman:
Low discrepancy sets yield approximate min-wise independent permutation families. 29-32 - Sung Kwon Kim, Chan-Su Shin, Tae-Cheon Yang:
Placing two disks in a convex polygon. 33-39 - Ted Herman, Sriram V. Pemmaraju:
Error-detecting codes and fault-containing self-stabilization. 41-46 - Vladimir Pestov:
On the geometry of similarity search: Dimensionality curse and concentration of measure. 47-51 - Enno Ohlebusch:
A uniform framework for term and graph rewriting applied to combined systems. 53-59 - Giorgio Gambosi, Gaia Nicosia:
On-line scheduling with setup costs. 61-68 - Uriel Feige, Joe Kilian:
Finding OR in a noisy broadcast network. 69-75
Volume 73, Numbers 3-4, 29 February 2000
- Vlady Ravelomanana, Loÿs Thimonier:
Patchworks and metablocks enumeration. 77-86 - Jean Marcel Pallo:
An efficient upper bound of the rotation distance of binary trees. 87-92 - Shahrokh Saeednia:
On the security of a convertible group signature scheme. 93-96 - Min-Shiang Hwang:
Cryptanalysis of YCN key assignment scheme in a hierarchy. 97-101 - Tzung-Shi Chen:
Task migration in 2D wormhole-routed mesh multicomputers. 103-110 - Alberto Caprara, Hans Kellerer, Ulrich Pferschy:
A PTAS for the Multiple Subset Sum Problem with different knapsack capacities. 111-118 - Ferdinando Cicalese, Ugo Vaccaro:
An improved heuristic for "Ulam-Rényi game". 119-124 - Rolf Niedermeier, Peter Rossmanith:
A general method to speed up fixed-parameter-tractable algorithms. 125-129 - Guillaume Fertin:
Hierarchical broadcast and gossip networks. 131-136 - David Avis, Luc Devroye:
Estimating the number of vertices of a polyhedron. 137-143 - Sukumar Ghosh, Xin He:
Fault-containing self-stabilization using priority scheduling. 145-151
Volume 73, Numbers 5-6, 31 March 2000
- Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg:
Pancyclicity in switching classes. 153-156 - Raymond Devillers, Joël Goossens:
Liu and Layland's schedulability test revisited. 157-161 - Atsushi Kaneko, Kiyoshi Yoshimoto:
On spanning trees with restricted degrees. 163-165 - Liang Chen, Naoyuki Tokuda:
A note on "Category and measure in complexity classes". 167-168 - Steven McKellar, Robert Davis:
Redundancy removal in multicast protocols. 169-173 - Zoltán Fülöp, Sebastian Maneth:
Domains of partial attributed tree transducers. 175-180 - Fanica Gavril:
Maximum weight independent sets and cliques in intersection graphs of filaments. 181-188 - Giovanni Dimauro, Sebastiano Impedovo, Giuseppe Pirlo, A. Salzo:
RNS architectures for the implementation of the 'diagonal function'. 189-198 - Amiya Nayak, Jiajun Ren, Nicola Santoro:
An improved testing scheme for catastrophic fault patterns. 199-206 - Achour Mostéfaoui, Michel Raynal, Frederic Tronel:
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. 207-212 - Amos Beimel, Eyal Kushilevitz:
Learning unions of high-dimensional boxes over the reals. 213-220 - Daniel Stefankovic:
Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. 221-225
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.
last updated on 2026-10-18 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
