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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Single jog minimum area joining of compacted cells
Andrew Lim
,
Yeow Meng Chee
,
Siu-Wing Cheng
Information Processing Letters
47
(4), 1993, pp. 167-172
Optimal speedup of Las Vegas algorithms
Michael Luby
,
Alistair Sinclair
,
David Zuckerman
Information Processing Letters
47
(4), 1993, pp. 173-180
Optimal parameters for load balancing using the diffusion method in
k
-ary
n
-cube networks
C.-Z. Xu
,
F.C.M. Lau
Information Processing Letters
47
(4), 1993, pp. 181-187
Syntactic error repair using repair patterns
In-Sig Yun
,
Kwang-Moo Choe
,
Taisook Han
Information Processing Letters
47
(4), 1993, pp. 189-196
Parallel trace-driven simulation of packet-switched mutiplexer under priority scheduling policy
Yi-Bing Lin
Information Processing Letters
47
(4), 1993, pp. 197-201
Inclusion and exclusion algorithm for the Hamiltonian Path Problem
Eric T. Bax
Information Processing Letters
47
(4), 1993, pp. 203-207
A faster alternative to SSS* with extension to variable memory
Subir Bhattacharya
,
A. Bagchi
Information Processing Letters
47
(4), 1993, pp. 209-214
A bounded-space tree traversal algorithm
D.S. Hirschberg
,
S.S. Seiden
Information Processing Letters
47
(4), 1993, pp. 215-219
An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object
Myung-Soo Kim
,
Jae-Woo Ahn
,
Soon-Bum Lim
Information Processing Letters
47
(5), 1993, pp. 221-229
On similarity of polynomial configurations
Nageswara S.V. Rao
,
Ching Luo
Information Processing Letters
47
(5), 1993, pp. 231-236
Static filtering on stratified programs
Byeong-Mo Chang
,
Kwang-Moo Choe
,
Taisook Han
Information Processing Letters
47
(5), 1993, pp. 237-244
On the reduction of LR
(k)
parsers
Woo-Jun Park
,
Myung-Joon Lee
,
Kwang-Moo Choe
Information Processing Letters
47
(5), 1993, pp. 245-251
Determining the majority
Laurent Alonso
,
Edward M. Reingold
,
René Schott
Information Processing Letters
47
(5), 1993, pp. 253-255
A string-matching algorithm for the CREW PRAM
Nalvo F., Jr. de Almeida
,
Valmir C. Barbosa
Information Processing Letters
47
(5), 1993, pp. 257-259
Leftmost one computation on meshes with row broadcasting
Himabindu Gurla
Information Processing Letters
47
(5), 1993, pp. 261-266
Optimal simulation of multidimensional reconfigurable meshes by two-dimensional reconfigurable meshes
Ramachandran Vaidyanathan
,
Jerry L. Trahan
Information Processing Letters
47
(5), 1993, pp. 267-273
Approximating the tree and tour covers of a graph
Esther M. Arkin
,
Magnús M. Halldórsson
,
Refael Hassin
Information Processing Letters
47
(6), 1993, pp. 275-282
Integer sorting on a mesh-connected array of processors
Danny Krizanc
Information Processing Letters
47
(6), 1993, pp. 283-289
Another glance at the Alpern-Schneider characterization of safety and liveness in concurrent executions
H. Peter Gumm
Information Processing Letters
47
(6), 1993, pp. 291-294
Static behavior analysis of a mesh system
Zhizhang Shen
Information Processing Letters
47
(6), 1993, pp. 295-299
A well-characterized approximation problem
Johan Håstad
,
Steven Phillips
,
Shmuel Safra
Information Processing Letters
47
(6), 1993, pp. 301-305
Unity properties and sequences of states, some observations
R.T. Udink
,
J.N. Kok
Information Processing Letters
47
(6), 1993, pp. 307-311
Linear speed-up does not hold on Turing machines with tree storages
Martin Hühne
Information Processing Letters
47
(6), 1993, pp. 313-318
A fast and effective heuristic for the feedback arc set problem
Peter Eades
,
Xuemin Lin
,
W.F. Smyth
Information Processing Letters
47
(6), 1993, pp. 319-323
Testing a simple polygon for monotonicity optimally in parallel
Danny Z. Chen
,
Sumantha Guha
Information Processing Letters
47
(6), 1993, pp. 325-331
Seiten
<
1
2