Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=75
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Timed automata and additive clock constraints
Béatrice Bérard
,
Catherine Dufourd
Information Processing Letters
75
(1-2), 2000, pp. 1-7
Quorums from difference covers
Charles J. Colbourn
,
Alan C.H. Ling
Information Processing Letters
75
(1-2), 2000, pp. 9-12
Gödelization in the lambda calculus
Mayer Goldberg
Information Processing Letters
75
(1-2), 2000, pp. 13-16
Abstracting numeric constraints with Boolean functions
Jacob M. Howe
,
Andy King
Information Processing Letters
75
(1-2), 2000, pp. 17-23
Cyclic-cubes and wrap-around butterflies
Meghanad D. Wagh
,
Prakash Math
,
Osman Guzide
Information Processing Letters
75
(1-2), 2000, pp. 25-27
Constrained multi-object auctions and
b
-matching
Michal Penn
,
Moshe Tennenholtz
Information Processing Letters
75
(1-2), 2000, pp. 29-34
Distributed similarity search algorithm in distributed heterogeneous multimedia databases
Ju-Hong Lee
,
Deok-Hwan Kim
,
Seok-Lyong Lee
,
Chin-Wan Chung
,
Guang-Ho Cha
Information Processing Letters
75
(1-2), 2000, pp. 35-42
A lower bound of
8/(7+\frac{1}{k-1}
on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut
Ari Freund
,
Howard Karloff
Information Processing Letters
75
(1-2), 2000, pp. 43-50
On the optimal utilization of all available states in the
2^n
moduli set
A.B. Premkumar
Information Processing Letters
75
(1-2), 2000, pp. 51-56
Improved bounds for dictionary look-up with one error
Gerth Stlting Brodal
,
S. Venkatesh
Information Processing Letters
75
(1-2), 2000, pp. 57-59
Exact solution of a minimal recurrence
Keh-Ning Chang
,
Shi-Chun Tsai
Information Processing Letters
75
(1-2), 2000, pp. 61-64
Edge-chromatic sum of trees and bounded cyclicity graphs
Krzysztof Giaro
,
Marek Kubale
Information Processing Letters
75
(1-2), 2000, pp. 65-69
On edge-disjoint spanning trees with small depths
Toru Hasunuma
Information Processing Letters
75
(1-2), 2000, pp. 71-74
A simple analysis of the harmonic algorithm for two servers
Marek Chrobak
,
Jiȓí Sgall
Information Processing Letters
75
(1-2), 2000, pp. 75-77
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
Yaoyun Shi
Information Processing Letters
75
(1-2), 2000, pp. 79-83
Bypassing BDD construction for reliability analysis
Poul Frederick Williams
,
Macha Nikolskaïa
,
Antoine Rauzy
Information Processing Letters
75
(1-2), 2000, pp. 85-89
A note on closure properties of logspace MOD classes
Ulrich Hertrampf
,
Steffen Reith
,
Heribert Vollmer
Information Processing Letters
75
(3), 2000, pp. 91-93
Covering a set of points by two-axis-parallel boxes
Sergei Bespamyatnikh
,
Michael Segal
Information Processing Letters
75
(3), 2000, pp. 95-100
A new universal and fault-tolerant quantum basis
P. Oscar Boykin
,
Tal Mor
,
Matthew Pulver
,
Vwani Roychowdhury
,
Farrokh Vatan
Information Processing Letters
75
(3), 2000, pp. 101-107
How rich is the structure of the intrinsic complexity of learning
Andris Ambainis
Information Processing Letters
75
(3), 2000, pp. 109-112
Computational complexity of similarity retrieval in a pictorial database
D.J. Guan
,
Chun-Yen Chou
,
Chiou-Wei Chen
Information Processing Letters
75
(3), 2000, pp. 113-117
On the computational power of linearly transformed BDDs
Wolfgang Günther
,
Rolf Drechsler
Information Processing Letters
75
(3), 2000, pp. 119-125
Clique polynomials hava a unique root of smallest modulus
Massimiliano Goldwurm
,
Massimo Santini
Information Processing Letters
75
(3), 2000, pp. 127-132
Approximation algorithms for the TSP with sharpened triangle inequality
Hans-Joachim Böckenhauer
,
Juraj Hromkovic̑
,
Ralf Klasing
,
Sebastian Seibert
,
Walter Unger
Information Processing Letters
75
(3), 2000, pp. 133-138
Simplified proof of the Fourier sampling theorem
Peter Hyer
Information Processing Letters
75
(4), 2000, pp. 139-143
Seiten 1
2
>