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=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal coteries and voting schemes
Krzysztof Diks
,
Evangelos Kranakis
,
Danny Krizanc
,
Bernard Mans
,
Andrzej Pelc
Information Processing Letters
51
, 1994, pp. 1-6
A note on SpanP functions
Meena Mahajan
,
Thomas Thierauf
,
N.V. Vinodchandran
Information Processing Letters
51
, 1994, pp. 7-10
New algorithms for the LCA problem and the binary tree reconstruction problem
Zhaofang Wen
Information Processing Letters
51
, 1994, pp. 11-16
On the relationship between
\varepsilon
-biased random variables and
\varepsilon
-dependent random variables
Shuji Jimbo
,
Akira Maruoka
Information Processing Letters
51
, 1994, pp. 17-23
A fast algorithm for Euclidean distance maps of a 2-D binary image
Ling Chen
,
Henry Y.H. Chuang
Information Processing Letters
51
, 1994, pp. 25-29
Designing algorithms by expectations
Joseph Gil
,
Yossi Matias
Information Processing Letters
51
, 1994, pp. 31-34
Automorphisms of broadcasting schemes with respect to start rounds
Yoshihide Igarashi
,
Shingo Osawa
,
Walter Unger
Information Processing Letters
51
, 1994, pp. 35-41
Logics and decidability for labelled pre- and partially ordered Kripke structures
Antonia Sinachopoulos
Information Processing Letters
51
, 1994, pp. 43-52
On disjoint concave chains in arrangements of (pseudo) lines
Dan Halperin
,
Micha Sharir
Information Processing Letters
51
, 1994, pp. 53-56
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals
Norbert Blum
,
Henning Rochow
Information Processing Letters
51
, 1994, pp. 57-60
A term equality problem equaivalent to graph isomorphism
David A. Basin
Information Processing Letters
51
, 1994, pp. 61-66
Prefax grammars: An alternative characterization of the regular languages
Michael Frazier
,
C. David, Jr. Page
Information Processing Letters
51
, 1994, pp. 67-71
Increasing the rate of output of
m
-sequences
Simon R. Blackburn
Information Processing Letters
51
, 1994, pp. 73-77
Census techniques collapse space classes
Edith Hemaspaandra
Information Processing Letters
51
, 1994, pp. 79-84
Grammar coverings of a deterministic parser with action conflicts
Eun-Jung Lee
,
Kwang-Moo Choe
Information Processing Letters
51
, 1994, pp. 85-92
On fault-tolerant fixed routing in hypercubes
Abhijit Sengupta
,
Suresh Viswanathan
Information Processing Letters
51
, 1994, pp. 93-99
A lower bound for area-universal graphs
Gianfranco Bilardi
,
Shiva Chaudhuri
,
Devdatt Dubhashi
,
K. Mehlhorn
Information Processing Letters
51
, 1994, pp. 101-105
An optimal bound for path weights in Huffman trees
Peter Kirrinnis
Information Processing Letters
51
, 1994, pp. 107-110
Counting trees in a graph is
\#P
-complete
Mark Jerrum
Information Processing Letters
51
, 1994, pp. 111-116
A complete decoding algorithm for double-error-correcting primitive binary BCH codes of odd
m
Erl-Huei Lu
,
Yi-Chang Chen
,
Hsiao-Peng Wuu
Information Processing Letters
51
, 1994, pp. 117-120
A linear algorithm for centering a spanning tree of a biconnected graph
K.S. Easwarakumar
,
C. Pandu Rangan
,
G.A. Cheston
Information Processing Letters
51
, 1994, pp. 121-124
Enumeration of binary trees
Vinnakota Bapiraju
,
V.V. Bapeswara Rao
Information Processing Letters
51
, 1994, pp. 125-127
Internal path length of the binary representation of heap-ordered trees
Wen-Chin Chen
,
Wen-Chen Ni
Information Processing Letters
51
, 1994, pp. 129-132
Approximations for the maximum acyclic subgraph problem
Refael Hassin
,
Shlomi Rubinstein
Information Processing Letters
51
, 1994, pp. 133-140
The convex-hull-and-line traveling salesman problem: A solvable case
Vladimir G. Deineko
,
René van Dal
,
Günter Rote
Information Processing Letters
51
, 1994, pp. 141-148
Seiten 1
2
3
>