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=33
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The average-case parallel complexity of sorting
Ravi B. Boppana
Information Processing Letters
33
, 1989/90, pp. 145-146
Optimal parallel algorithms on circular-arc graphs
A. Srinivasa Rao
,
C. Pandu Rangan
Information Processing Letters
33
, 1989/90, pp. 147-156
Constructing sorting networks from
k
-sorters
Bruce Parker
,
Ian Parberry
Information Processing Letters
33
, 1989/90, pp. 157-162
Symmetric quotients and domain constructions
Rudolf Berghammer
,
Gunther Schmidt
,
Hans Zierer
Information Processing Letters
33
, 1989/90, pp. 163-168
Finding the upper envelope of
n
line segments in
O(n\log n)
time
John Hershberger
Information Processing Letters
33
, 1989/90, pp. 169-174
Parallel batched planar point location on the CCC
D.T. Lee
,
F.P. Preparata
Information Processing Letters
33
, 1989/90, pp. 175-179
Optimal merging and sorting on the EREW PRAM
Torben Hagerup
,
Christine Rüb
Information Processing Letters
33
, 1989/90, pp. 181-185
A note on adaptive parallel sorting
Christos Levcopoulos
,
Ola Petersson
Information Processing Letters
33
, 1989/90, pp. 187-191
Undecidability of the bandwidth problem on linear graph languages
Egon Wanke
,
Manfred Wiegers
Information Processing Letters
33
, 1989/90, pp. 193-197
On the polynomial IO-complexity
José D.P. Rolim
Information Processing Letters
33
, 1989/90, pp. 199-204
An algorithm to find polygon similarity
Jayaramaiah Boreddy
,
R.N. Mukherjee
Information Processing Letters
33
, 1989/90, pp. 205-206
An explicit separation of relativised random polynomial time and relativised deterministic polynomial time
Richard Zippel
Information Processing Letters
33
, 1989/90, pp. 207-212
A randomised heuristical algorithm for estimating the chromatic number of a graph
Janez Z̑erovnik
Information Processing Letters
33
, 1989/90, pp. 213-219
Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems
P. Crescenzi
,
R. Silvestri
Information Processing Letters
33
, 1989/90, pp. 221-226
A linear algorithm for bipartition of biconnected graphs
Hitoshi Suzuki
,
Naomi Takahashi
,
Takao Nishizeki
Information Processing Letters
33
, 1989/90, pp. 227-231
Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
Yijie Han
,
Yoshihide Igarashi
Information Processing Letters
33
, 1989/90, pp. 233-238
A result relating disjunctive self-reducibility to P-immunity
Jürgen Kämper
Information Processing Letters
33
, 1989/90, pp. 239-242
Fast Hough transform on a mesh connected processor array
C.S. Kannan
,
Henry Y.H. Chuang
Information Processing Letters
33
, 1989/90, pp. 243-248
Common intersections of polygons
Laurence Boxer
,
Russ Miller
Information Processing Letters
33
, 1989/90, pp. 249-254
Exploiting logical structures in replicated databases
Divyakant Agrawal
,
Amr El Abbadi
Information Processing Letters
33
, 1989/90, pp. 255-260
On the deterministic complexity of factoring polynomials over finite fields
Victor Shoup
Information Processing Letters
33
, 1989/90, pp. 261-267
A simple randomized parallel algorithm for list-ranking
Richard J. Anderson
,
Gary L. Miller
Information Processing Letters
33
, 1989/90, pp. 269-273
Parallel algorithms on circular-arc graphs
Alan A. Bertossi
,
Sabrina Moretti
Information Processing Letters
33
, 1989/90, pp. 275-281
Realizability of Delaunay triangulations
Michael B. Dillencourt
Information Processing Letters
33
, 1989/90, pp. 283-287
Path integral evaluation of ALOHA network transients
Neil J. Gunther
,
John G. Shaw
Information Processing Letters
33
, 1989/90, pp. 289-295
Seiten
<
1
2
3
>