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=55
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
ECFSM-based probabilistic protocol verification
Chung-Ming Huang
,
Jenq-Muh Hsu
,
Shiun-Wei Lee
Information Processing Letters
55
, 1995, pp. 1-9
Computing a perfect edge without vertex elimination ordering of a chordal biparite graph
T. Kloks
,
D. Kratsch
Information Processing Letters
55
, 1995, pp. 11-16
Probabilistic analysis of
k
-dimensional packing algorithms
Dawei Hong
,
Joseph Y-T. Leung
Information Processing Letters
55
, 1995, pp. 17-24
Addendum to "A fully parallel algorithm for residue to binary conversion"
Ferrucio Barsi
,
M. Cristina Perotti
Information Processing Letters
55
, 1995, pp. 25-26
A note on
Mod
and generalised
Mod
classes
Meena Mahajan
,
N.V. Vinodchandran
Information Processing Letters
55
, 1995, pp. 27-31
Fairness and partial order semantics
Walter Vogler
Information Processing Letters
55
, 1995, pp. 33-39
1-Approximation algorithm for bottleneck disjoint path matching
Alak K. Datta
,
Ranjan K. Sen
Information Processing Letters
55
, 1995, pp. 41-44
Fair reconstruction of a secret
Hung-Yu Lin
,
Lein Harn
Information Processing Letters
55
, 1995, pp. 45-47
On the generalized twisted cube
Fouad B. Chedid
Information Processing Letters
55
, 1995, pp. 49-52
On generalized twisted cubes
Paul Cull
,
Shawn M. Larson
Information Processing Letters
55
, 1995, pp. 53-55
Easy verification of behavioural subtyping in common cases
Greg Butler
Information Processing Letters
55
, 1995, pp. 57-58
Linear bounds for on-line Steiner problems
Jeffery Westbrook
,
Dicky Yan
Information Processing Letters
55
, 1995, pp. 59-63
The lazy z-buffer
Steve Hill
Information Processing Letters
55
, 1995, pp. 65-70
The pagenumber of the class of bandwidth-
k
graphs is
k-1
R.P. Swaminathan
,
D. Giriraj
,
D.K. Bhatia
Information Processing Letters
55
, 1995, pp. 71-74
Finding an approximate minimum-link visibility path inside a simple polygon
Muhammad H. Alsuwaiyel
,
D.T. Lee
Information Processing Letters
55
, 1995, pp. 75-79
Some results on selectivity and self-reducibility
Jie Wang
Information Processing Letters
55
, 1995, pp. 81-87
A 3-valued wakeup protocol
John D. Valois
Information Processing Letters
55
, 1995, pp. 89-93
Iterative improvement of vertex covers
Youssef Saab
Information Processing Letters
55
, 1995, pp. 95-98
Simple linear time recognition of unit interval graphs
Derek G. Corneil
,
Hiryoung Kim
,
Sridhar Natarajan
,
Stephan Olariu
,
Alan P. Sprague
Information Processing Letters
55
, 1995, pp. 99-104
A fast algorithm for string matching with mismatches
A. Dermouche
Information Processing Letters
55
, 1995, pp. 105-110
Incremental constraint deletion in systems of linear constraints
Tien Huynh
,
Kim Marriott
Information Processing Letters
55
, 1995, pp. 111-115
An optimality proof for asynchronous recovery algorithms in distributed systems
Mukesh Singhal
,
Friedemann Mattern
Information Processing Letters
55
, 1995, pp. 117-121
A scheme to construct distance-three codes using latin squares, with applications to the
n
-cube
Pranava K. Jha
,
Giora Slutzki
Information Processing Letters
55
, 1995, pp. 123-127
Untiming timed languages
BĂ©atrice Berard
Information Processing Letters
55
, 1995, pp. 129-135
Simulations between two reconfigurable mesh models
Hongchi Shi
,
Gerhard X. Ritter
,
Joseph N. Wilson
Information Processing Letters
55
, 1995, pp. 137-142
Seiten 1
2
3
>