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
[2]
Hilfe
Suche: Author="Imai, H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
OBDDs of a monotone function and its prime implicants
K. Hayase
,
H. Imai
Theory of Computing Systems
31
(5), 1998, pp. 579-591
Oracles versus proof techniques that do not relativize
Eric Allender
Lecture Notes in Computer Science
450
, 1990, pp. 39-52
Parallel convexity algorithms for digitized images on a linear array of processors
Hussein M. Alnuweiri
,
V.K. Prasanna Kumar
Lecture Notes in Computer Science
450
, 1990, pp. 397-406
Topological sweeping in three dimensions
Efthymios G. Anagnostou
,
Leonidas J. Guibas
,
Vassilios G.Polimenis
Lecture Notes in Computer Science
450
, 1990, pp. 310-317
Algorithms for projecting points to give the most uniform distribution with applications to hashing
Tetsuo Asano
,
Takeshi Tokuyama
Lecture Notes in Computer Science
450
, 1990, pp. 300-309
On the complexity of isometric embedding in the hypercube
David Avis
Lecture Notes in Computer Science
450
, 1990, pp. 348-357
Optimal linear broadcast
Sara Bitan
,
Shmuel Zaks
Lecture Notes in Computer Science
450
, 1990, pp. 368-377
Sublinear merging and natural merge sort
Svante Carlsson
,
Christos Levcopoulos
,
Ola Petersson
Lecture Notes in Computer Science
450
, 1990, pp. 251-260
Finding least-weight subsequences with fewer processors
Kwong-fai Chan
,
Tak-wah Lam
Lecture Notes in Computer Science
450
, 1990, pp. 318-327
20-relative neighborhood graphs are Hamiltonian
Maw Shang Chang
,
C.Y. Tang
,
R.C.T. Lee
Lecture Notes in Computer Science
450
, 1990, pp. 53-65
Searching in higher dimension
Bernard Chazelle
Lecture Notes in Computer Science
450
, 1990, pp. 155-155
Distributed algorithms for deciphering
Michel Cosnard
,
Jean-Laurent Philippe
Lecture Notes in Computer Science
450
, 1990, pp. 191-200
Parallel algorithms for generating subsets and set partitions
Borivoje Djokić
,
Masahiro Miyakawa
,
Satoshi Sekiguchi
,
Ichiro Semba
,
Ivan Stojmenović
Lecture Notes in Computer Science
450
, 1990, pp. 76-85
Implicitly searching convolutions and computing depth of collision
David Dobkin
,
John Hershberger
,
David Kirkpatrick
,
Subhash Suri
Lecture Notes in Computer Science
450
, 1990, pp. 165-180
A hyperplane incidence problem with applications to counting distances
Herbert Edelsbrunner
,
Micha Sharir
Lecture Notes in Computer Science
450
, 1990, pp. 419-428
Randomized broadcast in networks
Uriel Feige
,
David Peleg
,
Prabhakar Raghavan
,
Eli Upfal
Lecture Notes in Computer Science
450
, 1990, pp. 128-137
Two probabilistic results on merging
Wenceslas Fernandez de la Vega
,
Sampath Kannan
,
Miklos Santha
Lecture Notes in Computer Science
450
, 1990, pp. 118-127
Recent progress in string algorithms
Zvi Galil
Lecture Notes in Computer Science
450
, 1990, pp. 1-1
Planar separators and the Euclidean norm
Hillel Gazit
,
Gary L. Miller
Lecture Notes in Computer Science
450
, 1990, pp. 338-347
Constructing strongly convex approximate hulls with inaccurate primitives
Leonidas Guibas
,
David Salesin
,
Jorge Stolfi
Lecture Notes in Computer Science
450
, 1990, pp. 261-270
Derandomization by exploiting redundancy and mutual independence
Yijie Han
,
Yoshihide Igarashi
Lecture Notes in Computer Science
450
, 1990, pp. 328-337
Parallel algorithms for linked list and beyond
Yijie Han
Lecture Notes in Computer Science
450
, 1990, pp. 86-100
Simultaneous solution of families of problems
Refael Hassin
Lecture Notes in Computer Science
450
, 1990, pp. 288-299
Local tournaments and proper circular arc graphs
Pavol Hell
,
Jrgen Bang-Jensen
,
Jing Huang
Lecture Notes in Computer Science
450
, 1990, pp. 101-108
Algorithms from complexity theory: Polynomial-time operations for complex sets
Lane A. Hemachandra
Lecture Notes in Computer Science
450
, 1990, pp. 221-231
Seiten 1
2
3
>