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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=50
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A token based
k
-resilient mutual exclusion algorithm for distributed systems
Dhananjay M. Dhamdhere
,
Sandeep S. Kulkarni
Information Processing Letters
50
, 1994, pp. 151-157
Logic program semantics and circumscription of autoepistemic theories
Li Yan Yuan
Information Processing Letters
50
, 1994, pp. 159-164
Distributed algorithms for multiple entries to a critical section with priority
R. Baldoni
,
B. Ciciani
Information Processing Letters
50
, 1994, pp. 165-172
Simpler proof of a realizability theorem on Delaunay triangulations
Kokichi Sugihara
Information Processing Letters
50
, 1994, pp. 173-176
On the serializability theorem for nested transactions
R.F. Resende
,
A. El Abbadi
Information Processing Letters
50
, 1994, pp. 177-183
A primal-dual approximation algorithm for the Steiner forest problem
R. Ravi
Information Processing Letters
50
, 1994, pp. 185-189
An algorithm for approximate membership checking with application to password security
Udi Manber
,
Sun Wu
Information Processing Letters
50
, 1994, pp. 191-197
Directed monotone contact networks for threshold functions
Jaikumar Radhakrishnan
,
K.V. Subrahmanyam
Information Processing Letters
50
, 1994, pp. 199-203
Approximating
x^n
efficiently
Chandrasekhar Narayanaswami
,
William Luken
Information Processing Letters
50
, 1994, pp. 205-210
Bounded-width polynomial-size Boolean formulas compute exactly those functions in
AC^0
Sorin Istrail
,
Dejan Zivkovic
Information Processing Letters
50
, 1994, pp. 211-216
Multiprocessor interconnection network using pairwise balanced combinatorial designs
Simon Y. Berkovich
Information Processing Letters
50
, 1994, pp. 217-222
Consistent global checkpoints based on direct dependency tracking
Yi-Min Wang
,
Andy Lowry
,
W. Kent Fuchs
Information Processing Letters
50
, 1994, pp. 223-230
Sparse matrix vector multiplication on distributed architectures: Lower bounds and average complexity results
Giovanni Manzini
Information Processing Letters
50
, 1994, pp. 231-238
An optimal algorithm to compute all the covers of a string
Dennis Moore
,
W.F. Smyth
Information Processing Letters
50
, 1994, pp. 239-246
Nondominated
k
-coteries for multiple mutual exclusion
Mitchell L. Neilsen
,
Masaaki Mizuno
Information Processing Letters
50
, 1994, pp. 247-252
Trajectory planning in
H
-space
Huade Li
Information Processing Letters
50
, 1994, pp. 253-258
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
Seiten
<
1
2
3
>