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 YEAR=1994
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on the containment and minimization of (in)equality queries
Xubo Zhang
,
Z. Meral Ozsoyoglu
Information Processing Letters
50
, 1994, pp. 259-267
Single character searching methods and the shift-or pattern-matching algorithm
Chris H. Perleberg
Information Processing Letters
50
, 1994, pp. 269-275
On the relationship between the diameter and the size of a boundary of a directed graph
Shuji Jimbo
,
Akira Maruoka
Information Processing Letters
50
, 1994, pp. 277-282
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
Abraham P. Punnen
,
K.P.K. Nair
Information Processing Letters
50
, 1994, pp. 283-286
An optimal lower bound for nonregular languages
Alberto Bertoni
,
Carlo Mereghetti
,
Giovanni Pighizzini
Information Processing Letters
50
, 1994, pp. 289-292
Infinite words and biprefix codes
Giuseppe Pirillo
Information Processing Letters
50
, 1994, pp. 293-295
Minimal fully adaptive wormhole routing on hypercubes
Chiu-Chuan Lin
,
Ferng-Ching Lin
Information Processing Letters
50
, 1994, pp. 297-301
A note on a proposed LALR parser for extended context-free grammars
José Fortes Gálvez
Information Processing Letters
50
, 1994, pp. 303-305
Finding lowest common ancestors in arbitrarily directed trees
Matti Nykänen
,
Esko Ukkonen
Information Processing Letters
50
, 1994, pp. 307-310
An optimal algorithm for distributed snapshots with causal message ordering
Sridhar Alagar
,
S. Venkatesan
Information Processing Letters
50
, 1994, pp. 311-316
On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs
Jordan Gergov
,
Christoph Meinel
Information Processing Letters
50
, 1994, pp. 317-322
Uniform generation of forests of restricted height
M.D. Atkinson
,
J.-R. Sack
Information Processing Letters
50
, 1994, pp. 323-327
A recursion theorem for predicate transformers on inductive data types
David A. Naumann
Information Processing Letters
50
, 1994, pp. 329-336
Counting the number of fault patterns in redundant VLSI arrays
Linda Pagli
,
Geppino Pucci
Information Processing Letters
50
, 1994, pp. 337-342
Distributed termination detection in reducible communication graphs
Vittoria Gianuzzi
Information Processing Letters
49
, 1994, pp. 1-8
On finding the strongly connected components in a directed graph
Esko Nuutila
,
Eljas Soisalon-Soininen
Information Processing Letters
49
, 1994, pp. 9-14
On average time hierarchies
Mikael Goldmann
,
Per Grape
,
Johan Håstad
Information Processing Letters
49
, 1994, pp. 15-20
A shortest-path algorithm for Manhattan graphs
Kanchana Kanchanasut
Information Processing Letters
49
, 1994, pp. 21-25
On generating B-trees with constant average delay and in lexicographic order
Mounir Belbaraka
,
Ivan Stojmenović
Information Processing Letters
49
, 1994, pp. 27-32
Computing values of a polynomial with only few multiplications
D. Veljan
Information Processing Letters
49
, 1994, pp. 33-37
A randomized algorithm for finding maximum with
O((\log n)^2)
polynomial tests
Hing F. Ting
,
Andrew C. Yao
Information Processing Letters
49
, 1994, pp. 39-43
Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
C. Rhee
,
Y. Daniel Liang
,
S.K. Dhall
,
S. Lakshmivarahan
Information Processing Letters
49
, 1994, pp. 45-50
The domatic number problem on some perfect graph families
Haim Kaplan
,
Ron Shamir
Information Processing Letters
49
, 1994, pp. 51-56
Real-time leader election
Gurdip Singh
Information Processing Letters
49
, 1994, pp. 57-61
An efficient computation of right context for LR-based error repair
Min-Soo Jung
,
Kwang-Moo Choe
,
Taisook Han
Information Processing Letters
49
, 1994, pp. 63-71
Seiten
<
1
2
3
4
5
6
7
8
9
>