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=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some pursuit-evasion problems on grids
Robin W. Dawes
Information Processing Letters
43
, 1992, pp. 241-247
A note on Raymond's tree based algorithm for distributed mutual exclusion
R. Satyanarayanan
,
D.R. Muthukrishnan
Information Processing Letters
43
, 1992, pp. 249-255
An optimal algorithm for generating minimal perfect hash functions
Zbigniew J. Czech
,
George Havas
,
Bohdan S. Majewski
Information Processing Letters
43
, 1992, pp. 257-264
Analysis of hierarchical bus-based multicomputer architectures
A.S. Pombortsis
Information Processing Letters
43
, 1992, pp. 265-270
Random list permutations in place
Eugene K. Ressler
Information Processing Letters
43
, 1992, pp. 271-275
An improved lower bound for on-line bin packing algorithms
André van Vliet
Information Processing Letters
43
, 1992, pp. 277-284
Optimal routing in toroidal networks
Izidor Jerebic
,
Roman Trobec
Information Processing Letters
43
, 1992, pp. 285-291
Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
Maw-Shang Chang
,
Fu-Hsing Wang
Information Processing Letters
43
, 1992, pp. 293-295
A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
Shen-Lung Peng
,
Maw-Shang Chang
Information Processing Letters
43
, 1992, pp. 297-300
Weakest precondition semantics for time and concurrency
D. Scholefield
,
H.S.M. Zedan
Information Processing Letters
43
, 1992, pp. 301-308
A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
Eliezer A. Albacea
Information Processing Letters
43
, 1992, pp. 309-314
A mean value analysis of the Ethernet throughput
Cheeha Kim
,
Jong-Sung Kim
Information Processing Letters
43
, 1992, pp. 315-320
A note on two-way probabilistic automata
Jie Wang
Information Processing Letters
43
, 1992, pp. 321-326
Decomposition - An approach for optimizing queries including ADT functions
Hanxiong Chen
,
Xu Yu
,
Kazunori Yamaguchi
,
Hiroyuki Kitagawa
,
Nobuo Ohbo
,
Yuzuru Fujiwara
Information Processing Letters
43
, 1992, pp. 327-333
On a compaction theorem of Ragde
Torben Hagerup
Information Processing Letters
43
, 1992, pp. 335-340
A note on approximate linear programming
Nimrod Megiddo
Information Processing Letters
42
, 1992, pp. 53
On the structural grammatical inference problem for some classes of context-free grammars
Erkki Mäkinen
Information Processing Letters
42
, 1992, pp. 1-5
Towards an understanding of unbounded variables in asynchronous systems
Ambuj K. Singh
Information Processing Letters
42
, 1992, pp. 7-17
A linear time algorithm for graph partition problems
L.H. Clark
,
F. Shahrokhi
,
L.A. Székely
Information Processing Letters
42
, 1992, pp. 19-24
A lower bound for the nondeterministic space complexity of context-free recognition
Helmut Alt
,
Viliam Geffert
,
Kurt Mehlhorn
Information Processing Letters
42
, 1992, pp. 25-27
Detecting cycles through three fixed vertices in a graph
Herbert Fleischner
,
Gerhard J. Woeginger
Information Processing Letters
42
, 1992, pp. 29-33
Computing the minimum weight triangulation of a set of linearly ordered points
Henk Meijer
,
David Rappaport
Information Processing Letters
42
, 1992, pp. 35-38
On the routing problem in faulty supercubes
Arunabha Sen
,
Abhijit Sengupta
,
Subir Bandyopadhyay
Information Processing Letters
42
, 1992, pp. 39-46
Effective use of memory in iterative deepening search
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. De Sarkar
Information Processing Letters
42
, 1992, pp. 47-52
Optimal time bounds for some proximity problems in the plane
Alok Aggarwal
,
Herbert Edelsbrunner
,
Prabhakar Raghavan
,
Prasoon Tiwari
Information Processing Letters
42
, 1992, pp. 55-60
Seiten
<
1
2
3
4
5
6
7
8
9
10
>