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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rectangular partition is polynomial in two dimensions but
NP
-complete in three
Victor J. Dielissen
,
Anne Kaldewaij
Information Processing Letters
38
, 1991, pp. 1-6
Alternation with a pebble
P. Goralc̑ik
,
A. Goralc̑ikova
,
V. Koubek
Information Processing Letters
38
, 1991, pp. 7-13
Bisections and ham-sandwich cuts of convex polygons and polyhedra
Ivan Stojmenović
Information Processing Letters
38
, 1991, pp. 15-21
Integrity aspects of quasi serializability
Ahmed K. Elmagarmid
,
Weimin Du
Information Processing Letters
38
, 1991, pp. 23-28
Optimal speed-up algorithms for template matching on SIMD hypercube multiprocessors with restricted local memory
Shi-Jinn Horng
,
Wen-Tsuen Chen
,
Ming-Yi Fang
Information Processing Letters
38
, 1991, pp. 29-37
Smoothness and factoring polynomials over finite fields
Victor Shoup
Information Processing Letters
38
, 1991, pp. 39-42
A graph transformation algorithm for concurrency control in a partitioned database
Xu Cheng
Information Processing Letters
38
, 1991, pp. 43-48
A unified approach to parallel depth-first traversals of general trees
Calvin C.-Y. Chen
,
Sajal K. Das
Information Processing Letters
38
, 1991, pp. 49-55
Efficient parallel algorithms to test square-freeness and factorize strings
Maxime Crochemore
,
Wojciech Rytter
Information Processing Letters
38
, 1991, pp. 57-60
The parallel complexity of two problems on concurrency
C. Álvarez
,
J. Gabarró
Information Processing Letters
38
, 1991, pp. 61-70
A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets
Hsu-Chun Yen
Information Processing Letters
38
, 1991, pp. 71-76
Radix sort on the hypercube
Giovanni Manzini
Information Processing Letters
38
, 1991, pp. 77-81
Lower bounds for arithmetic problems
João Meidânis
Information Processing Letters
38
, 1991, pp. 83-87
Dynamic behaviour in updating process over BST of size two with probabilistic deletion algorithms
Xavier Messeguer
Information Processing Letters
38
, 1991, pp. 89-100
Phase synchronization
Jayadev Misra
Information Processing Letters
38
, 1991, pp. 101-105
The towers of Antwerpen problem
Steven Minsker
Information Processing Letters
38
, 1991, pp. 107-111
Online matching with blocked input
Ming-Yang Kao
,
Stephen R. Tate
Information Processing Letters
38
, 1991, pp. 113-116
On matroids and hierarchical graphs
David Fernández-Baca
,
Mark A. Williams
Information Processing Letters
38
, 1991, pp. 117-121
Computing the minimum Hausdorff distance between two point sets on a line under translation
Günter Rote
Information Processing Letters
38
, 1991, pp. 123-127
Circuits for computing the GCD of two polynomials over an algebraic number field
Lars Langemyr
Information Processing Letters
38
, 1991, pp. 129-134
Self-adjusting multi-way search trees
Charles Martel
Information Processing Letters
38
, 1991, pp. 135-141
A new optimal distributed algorithm for the set intersection problem
Subbiah Rajanarayanan
,
Sitharama S. Iyengar
Information Processing Letters
38
, 1991, pp. 143-148
Counting
k
-subsets and convex
k
-gons in the plane
Günter Rote
,
Gerhard Woeginger
,
Binhai Zhu
,
Zhengyan Wang
Information Processing Letters
38
, 1991, pp. 149-151
A div(
n
) depth Boolean circuit for smooth modular inverse
Michal Mn̑uk
Information Processing Letters
38
, 1991, pp. 153-156
A deadlock-free communication kernel for loop architecture
P. Pramanik
,
P.K. Das
,
A.K. Bandyopadhyay
,
D.Q.M. Fay
Information Processing Letters
38
, 1991, pp. 157-161
Seiten 1
2
3
>