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: Author="Aumann, Yonatan"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quasi-distinct parsing and optimal compression methods
Amihood Amir
,
Yonatan Aumann
,
Avivit Levy
,
Yuri Roshko
Theoretical Computer Science
422
, 2012, pp. 1-14
Pattern matching with address errors: Rearrangement distances
Amihood Amir
,
Yonatan Aumann
,
Gary Benson
,
Avivit Levy
,
Ohad Lipsky
,
Ely Porat
,
Steven Skiena
,
Uzi Vishne
Journal of Computer and System Sciences
75
(6), 2009, pp. 359-370
Efficient computations of
l_1
and
l_\infty
rearrangement distances
Amihood Amir
,
Yonatan Aumann
,
Piotr Indyk
,
Avivit Levy
,
Ely Porat
Theoretical Computer Science
410
(43), 2009, pp. 4382-4390
Approximate string matching with address bit errors
Amihood Amir
,
Yonatan Aumann
,
Oren Kapah
,
Avivit Levy
,
Ely Porat
Theoretical Computer Science
410
(51), 2009, pp. 5334-5346
Quasi-distinct parsing and optimal compression methods
Amihood Amir
,
Yonatan Aumann
,
Avivit Levy
,
Yuri Roshko
Lecture Notes in Computer Science
5577
, 2009, pp. 12-25
Approximate string matching with address bit errors
Amihood Amir
,
Yonatan Aumann
,
Oren Kapah
,
Avivit Levy
,
Ely Porat
Lecture Notes in Computer Science
5029
, 2008, pp. 118-129
Finding witnesses by peeling
Yonatan Aumann
,
Moshe Lewenstein
,
Noa Lewenstein
,
Dekel Tsur
Lecture Notes in Computer Science
4580
, 2007, pp. 28-39
Optimization of probe coverage for high-resolution oligonucleotide aCGH
Doron Lipson
,
Zohar Yakhini
,
Yonatan Aumann
Bioinformatics
23
(2), 2007, pp. 77-83
Function matching
Amihood Amir
,
Yonatan Aumann
,
Moshe Lewenstein
,
Ely Porat
SIAM Journal on Computing
35
(5), 2006, pp. 1007-1022
Designing optimally multiplexed SNP genotyping assays
Yonatan Aumann
,
Efrat Manisterski
,
Zohar Yakhini
Journal of Computer and System Sciences
70
(3), 2005, pp. 399-417
Efficient calculation of interval scores for DNA copy number data analysis
Doron Lipson
,
Yonatan Aumann
,
Amir Ben-Dor
,
Nathan Linial
,
Zohar Yakhini
LNCS/LNBI
3500
, 2005, pp. 83-100
Function matching: Algorithms, applications, and a lower bound
Amihood Amir
,
Yonatan Aumann
,
Richard Cole
,
Moshe Lewenstein
,
Ely Porat
Lecture Notes in Computer Science
2719
, 2003, pp. 929-942
Linear-constistency testing
Yonatan Aumann
,
Johan Håstad
,
Michael O. Rabin
,
Madhu Sudan
Journal of Computer and System Sciences
62
(4), 2001, pp. 589-607
Pattern matching with swaps
Amihood Amir
,
Yonatan Aumann
,
Gad M. Landau
,
Moshe Lewenstein
,
Noa Lewenstein
Journal of Algorithms
37
(2), 2000, pp. 247-266
On the cost of recomputing: Tight bounds on pebbling with faults
Yonatan Aumann
,
Judit Bar-Ilan
,
Uriel Feige
Theoretical Computer Science
233
(1-2), 2000, pp. 247-261
Linear consistency testing
Yonatan Aumann
,
Johan Håstad
,
Michael O. Rabin
,
Madhu Sudan
Lecture Notes in Computer Science
1671
, 1999, pp. 109-120
Cooperative sharing and asynchronous consensus using single-reader single-writer registers
Yonatan Aumann
,
Avivit Kapah-Levy
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 61-70
An
O(\log k)
approximate min-cut max-flow theorem and approximation algorithm
Yonatan Aumann
,
Yuval Rabani
SIAM Journal on Computing
27
(1), 1998, pp. 291-301
Pattern matching with swaps
Amihood Amir
,
Yonatan Aumann
,
Gad M. Landau
,
Moshe Lewenstein
,
Noa Lewenstein
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 144-153
Efficient execution of nondeterministic parallel programs on asynchronous systems
Yonatan Aumann
,
Michael A. Bender
,
Lisa Zhang
Information and Computation
139
(1), 1997, pp. 1-16
Efficient execution of nondeterministic parallel programs on asynchronous systems
Yonatan Aumann
,
Michael A. Bender
,
Lisa Zhang
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'96 (Padua, Italy, June 24-26, 1996)
, 1996, pp. 270-276
Fault tolerant data structures
Yonatan Aumann
,
Michael A. Bender
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 580-589
Efficient asynchronous consensus with the value-oblivious adversary scheduler
Yonatan Aumann
,
Michael A. Bender
Lecture Notes in Computer Science
1099
, 1996, pp. 622-633
Improved bounds for all optical routing
Yonatan Aumann
,
Yuval Rabani
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 567-576
On the cost of recomputing: Tight bounds on pebbling with faults
Yonatan Aumann
,
Judit Bar-Ilan
,
Uriel Feige
Lecture Notes in Computer Science
820
, 1994, pp. 47-58
Seiten 1
2
>