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=43
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on the permanent value problem
Sanjeev Saluja
Information Processing Letters
43
, 1992, pp. 1-5
Drawing the planar dual
Marshall Bern
,
John R. Gilbert
Information Processing Letters
43
, 1992, pp. 7-13
Associative-commutative reduction orderings
Leo Bachmair
Information Processing Letters
43
, 1992, pp. 21-27
Approximate decision algorithms for approximate congruence
Stefan Schirra
Information Processing Letters
43
, 1992, pp. 29-34
Learing convex bodies under uniform distribution
W. Kern
Information Processing Letters
43
, 1992, pp. 35-39
An algorithm for flow time minimization and its asymptotic makespan properties
Li-Hui Tsai
Information Processing Letters
43
, 1992, pp. 41-46
An efficient implementation of vector clocks
Mukesh Singhal
,
Ajay Kshemkalyani
Information Processing Letters
43
, 1992, pp. 47-52
On the greedy algorithm for satisfiability
Elias Koutsoupias
,
Christos H. Papadimitriou
Information Processing Letters
43
, 1992, pp. 53-55
A new SLDNF-tree
Maurizio Martelli
,
Chiara Tricomi
Information Processing Letters
43
, 1992, pp. 57-62
The algorithmic complexity of colour switching
Yeow Meng Chee
,
Andrew Lim
Information Processing Letters
43
, 1992, pp. 63-68
Special subgraphs of weighted visibility graphs
F.R. Hsu
,
R.C.T. Lee
,
R.C. Chang
Information Processing Letters
43
, 1992, pp. 69-75
A self-stabilizing algorithm for maximal matching
Su-Chu Hsu
,
Shing-Tsaan Huang
Information Processing Letters
43
, 1992, pp. 77-81
Attacks on Okamoto and Tanaka's one-way ID-based key distribution system
Tzonelih Hwang
Information Processing Letters
43
, 1992, pp. 83-86
On a graph partition problem with application to VLSI layout
Arunabha Sen
,
Haiyong Deng
,
Sumanta Guha
Information Processing Letters
43
, 1992, pp. 87-94
Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in
O(N^2)
time
Mila E. Majster-Cederbaum
Information Processing Letters
43
, 1992, pp. 95-100
Mesh permutation routing with locality
Steven Cheung
,
Francis C.M. Lau
Information Processing Letters
43
, 1992, pp. 101-105
Optimality of wait-free atomic multiwriter variables
Ming Li
,
Paul M.B. Vitányi
Information Processing Letters
43
, 1992, pp. 107-112
Inductive data types for predicate transformers
Oege de Moor
Information Processing Letters
43
, 1992, pp. 113-117
On the power of enumerative counting
Sanjeev Saluja
,
K.V. Subrahmanyam
Information Processing Letters
43
, 1992, pp. 119-125
Finding the closest extreme vertex to a fixed point
Gerhard J. Woeginger
Information Processing Letters
43
, 1992, pp. 127-128
An efficient parallel sorting algorithm
Xiaoqing Liu
,
Junguk L. Kim
Information Processing Letters
43
, 1992, pp. 129-133
Sooner is safer than later
Thomas A. Henzinger
Information Processing Letters
43
, 1992, pp. 135-141
Distances from differences of roots of polynomials to the nearest integers
V.I. Galiev
,
A.F. Polupanov
,
I.E. Shparlinski
Information Processing Letters
43
, 1992, pp. 143-146
On undecidability of propositional temporal logics on trace systems
Wojciech Penczek
Information Processing Letters
43
, 1992, pp. 147-153
Complete sets of axioms for finite basic LOTOS behavioural equivalences
M. Boreale
,
P. Inverardi
,
M. Nesi
Information Processing Letters
43
, 1992, pp. 155-160
Seiten 1
2
3
>