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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast and simple nested fixpoints
Helmut Seidl
Information Processing Letters
59
(6), 1996, pp. 303-308
A note on the expected path length of trees with known fringe
Roberto De Prisco
,
Giuseppe Parlati
,
Giuseppe Persiano
Information Processing Letters
59
(6), 1996, pp. 309-315
On the communication complexity of polling
Adele A. Rescigno
Information Processing Letters
59
(6), 1996, pp. 317-323
Algebra of two-level cause-effect structures
A.P. Ustimenko
Information Processing Letters
59
(6), 1996, pp. 325-330
Intersection number of two connected geometric graphs
Shin-ichi Tokunaga
Information Processing Letters
59
(6), 1996, pp. 331-333
Algorithms for parsimonious complete sets in directed graphs
Avraham A. Melkman
,
Solomon E. Shimony
Information Processing Letters
59
(6), 1996, pp. 335-339
Finitistic proofs of 0-1 laws for fragments of second-order logic
Thierry Lacoste
Information Processing Letters
58
, 1996, pp. 1-4
A pursuit-evasion problem on a grid
Stewart W. Neufeld
Information Processing Letters
58
(1), 1996, pp. 5-9
Iterative deepening multiobjective
A
S. Harikumar
,
Shashi Kumar
Information Processing Letters
58
(1), 1996, pp. 11-15
Design and analysis of a generalized multi-ring architecture
Bagirath R. Krishnamachari
,
Ravi Mittal
Information Processing Letters
58
(1), 1996, pp. 17-21
On approximation algorithms for the minimum satisfiability problem
M.V. Marathe
,
S.S. Ravi
Information Processing Letters
58
(1), 1996, pp. 23-29
A note on a theorem of Barrington, Straubing and Thérien
Hervé Caussinus
Information Processing Letters
58
(1), 1996, pp. 31-33
Functions computable with limited access to
NP
Mitsunori Ogihara
Information Processing Letters
58
(1), 1996, pp. 35-38
On proving that a graph has no large clique: A connection with Ramsey theory
Richard J. Lipton
Information Processing Letters
58
(1), 1996, pp. 39-42
On path equivalence of nondeterministic finite automata
Wen-Guey Tzeng
Information Processing Letters
58
(1), 1996, pp. 43-46
Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
Lefteris M. Kirousis
,
Paul Spirakis
,
Philippas Tsigas
Information Processing Letters
58
(1), 1996, pp. 47-53
A simple
NC
-algorithm for a maximal independent set in a hypergraph of poly-log arboricity
Oscar Garrido
,
Pierre Kelsen
,
Andrzej Lingas
Information Processing Letters
58
(2), 1996, pp. 55-58
Perfect power tasting
R. Balasubramanian
,
S.V. Nagaraj
Information Processing Letters
58
(2), 1996, pp. 59-63
Multiple search problem on reconfigurable meshes
Chia-Chiang Chao
,
Wen-Tsen Chen
,
Gen-Huey Chen
Information Processing Letters
58
(2), 1996, pp. 65-69
Optimal location of facilities on a network with an unreliable node or link
H.A. Eiselt
,
Michel Gendreau
,
Gilbert Laporte
Information Processing Letters
58
(2), 1996, pp. 71-74
Unambiguous description of chain code picture languages
Changwook Kim
Information Processing Letters
58
(2), 1996, pp. 75-79
Some topological properties of star connected cycles
Marcelo M. de Azvedo
,
Nader Bagherzadeh
,
Martin Dowd
,
Shahram Latifi
Information Processing Letters
58
(2), 1996, pp. 81-85
A parallel parsing algorithm for arbitrary context-free grammars
Dong-Yul Ra
,
Jong-Hyun Kim
Information Processing Letters
58
(2), 1996, pp. 87-96
Extension of synthesis algorithm of recursive processes to
\mu
-calculus
Shigetomo Kimura
,
Atsushi Togashi
,
Norio Shiratori
Information Processing Letters
58
(2), 1996, pp. 97-104
Approximability of maximum splitting of
k
-sets and some other
Apx
-complete problems
Viggo Kann
,
Jens Lagergren
,
Alessandro Panconesi
Information Processing Letters
58
(3), 1996, pp. 105-110
Seiten
<
1
2
3
4
5
6
7
8
9
>