default search action
Information Processing Letters, Volume 75
Volume 75, Numbers 1-2, 31 July 2000
- Béatrice Bérard, Catherine Dufourd:
Timed automata and additive clock constraints. 1-7 - Charles J. Colbourn, Alan C. H. Ling:
Quorums from difference covers. 9-12 - Mayer Goldberg:
Gödelization in the lambda calculus. 13-16 - Jacob M. Howe
, Andy King:
Abstracting numeric constraints with Boolean functions. 17-23 - Meghanad D. Wagh, Prakash Math, Osman Guzide:
Cyclic-cubes and wrap-around butterflies. 25-27 - Michal Penn, Moshe Tennenholtz:
Constrained multi-object auctions and b-matching. 29-34 - Ju-Hong Lee, Deok-Hwan Kim, Seok-Lyong Lee, Chin-Wan Chung, Guang-Ho Cha:
Distributed similarity search algorithm in distributed heterogeneous multimedia databases. 35-42 - Ari Freund, Howard J. Karloff:
A lower bound of 8/(7+(1/k)-1) on the integrality ratio of the Calinescu-Karloff-Rabani relaxation for multiway cut. 43-50 - A. Benjamin Premkumar:
On the optimal utilization of all available states in the 2n moduli set. 51-56 - Gerth Stølting Brodal
Improved bounds for dictionary look-up with one error. 57-59 - Keh-Ning Chang, Shi-Chun Tsai:
Exact solution of a minimal recurrence. 61-64 - Krzysztof Giaro
Edge-chromatic sum of trees and bounded cyclicity graphs. 65-69 - Toru Hasunuma:
On edge-disjoint spanning trees with small depths. 71-74 - Marek Chrobak, Jirí Sgall
A simple analysis of the harmonic algorithm for two servers. 75-77 - Yaoyun Shi:
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables. 79-83 - Poul Frederick Williams, Macha Nikolskaïa, Antoine Rauzy
Bypassing BDD construction for reliability analysis. 85-89
Volume 75, Number 3, 31 August 2000
- Ulrich Hertrampf, Steffen Reith, Heribert Vollmer
A note on closure properties of logspace MOD classes. 91-93 - Sergei Bespamyatnikh, Michael Segal
Covering a set of points by two axis-parallel boxes. 95-100 - P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani P. Roychowdhury, Farrokh Vatan:
A new universal and fault-tolerant quantum basis. 101-107 - Andris Ambainis:
How rich is the structure of the intrinsic complexity of learning. 109-112 - D. J. Guan, Chun-yen Chou, Chiou-Wei Chen:
Computational complexity of similarity retrieval in a pictorial database. 113-117 - Wolfgang Günther, Rolf Drechsler
On the computational power of linearly transformed BDDs. 119-125 - Massimiliano Goldwurm, Massimo Santini
Clique polynomials have a unique root of smallest modulus. 127-132 - Hans-Joachim Böckenhauer
Approximation algorithms for the TSP with sharpened triangle inequality. 133-138
Volume 75, Number 4, 30 September 2000
- Peter Høyer
Simplified proof of the Fourier Sampling Theorem. 139-143 - K. V. R. C. N. Kishore, Sanjeev Saxena:
An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs. 145-151 - Bor-Kuan Lu, Fang-Rong Hsu, Chuan Yi Tang:
Guarding in a simple polygon. 153-158 - Fang-Cheng Leu, Yin-Te Tsai, Chuan Yi Tang:
An efficient external sorting algorithm. 159-163 - Ion I. Mandoiu
A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points. 165-167 - Alon Efrat
Computing Euclidean bottleneck matchings in higher dimensions. 169-174 - Paolo Boldi
Coverings that preserve sense of direction. 175-180 - Refael Hassin, Shlomi Rubinstein:
Better approximations for max TSP. 181-186
Volume 75, Number 5, 31 October 2000
- Zichen Li, Lucas Chi Kwong Hui, Kam-Pui Chow, C. F. Chong, Wai Wan Tsang, H. W. Chan:
Security of Tseng-Jan's group signature schemes. 187-189 - Eric Gamess:
plapackJava: Towards an efficient Java interface for high performance parallel linear algebra. 191-197 - Sherali Zeadally:
Performance evaluation of a Java-based networking Application Programming Interface (API). 199-209 - Andreu Riera, Josep Rifà
Efficient construction of vote-tags to allow open objection to the tally in electronic elections. 211-215 - John A. Ellis, Tobias Krahn, Hongbing Fan:
Computing the cycles in the perfect shuffle permutation. 217-224 - Bang Ye Wu:
Polynomial time algorithms for some minimum latency problems. 225-229 - Frank K. Hwang, C. K. Pai:
Sequential construction of a circular consecutive-2 system. 231-235
Volume 75, Number 6, 30 November 2000
- Tatiana Tambouratzis:
Solving the Hamiltonian cycle problem via an artificial neural network. 237-242 - Daisuke Takahashi
A fast algorithm for computing large Fibonacci numbers. 243-246 - Ing-Ray Chen, Ding-Chau Wang, Chih-Ping Chu:
Response time behavior of distributed voting algorithms for managing replicated data. 247-253 - Carlo Blundo
Visual cryptography for grey level images. 255-259 - Kousha Etessami:
A note on a question of Peled and Wilke regarding stutter-invariant LTL. 261-263 - Stavros D. Nikolopoulos, Charis Papadopoulos
On the performance of the first-fit coloring algorithm on permutation graphs. 265-273 - Claus Rick:
Simple and fast linear space computation of longest common subsequences. 275-281
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 2025-01-02 18:02 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by: