|
Search the dblp DataBase
Yonatan Aumann:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila
Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. [Citation Graph (3, 0)][DBLP] DMKD, 1997, pp:0-0 [Conf]
- Ronen Feldman, Yonatan Aumann, Michal Finkelstein-Landau, Eyal Hurvitz, Yizhar Regev, Ariel Yaroshevich
A Comparative Study of Information Extraction Strategies. [Citation Graph (0, 0)][DBLP] CICLing, 2002, pp:349-359 [Conf]
- Ronen Feldman, Yonatan Aumann, Yair Liberzon, Kfir Ankori, Yonatan Schler, Binyamin Rosenfeld
A Domain Independent Environment for Creating Information Extraction Modules. [Citation Graph (0, 0)][DBLP] CIKM, 2001, pp:586-588 [Conf]
- Binyamin Rosenfeld, Ronen Feldman, Yonatan Aumann
Structural extraction from visual layout of documents. [Citation Graph (0, 0)][DBLP] CIKM, 2002, pp:203-210 [Conf]
- Binyamin Rosenfeld, Ronen Feldman, Moshe Fresko, Jonathan Schler, Yonatan Aumann
TEG: a hybrid approach to information extraction. [Citation Graph (0, 0)][DBLP] CIKM, 2004, pp:589-596 [Conf]
- Yonatan Aumann, Uriel Feige
On Message Proof Systems with Known Space Verifiers. [Citation Graph (0, 0)][DBLP] CRYPTO, 1993, pp:85-99 [Conf]
- Yonatan Aumann, Michael O. Rabin
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract). [Citation Graph (0, 0)][DBLP] CRYPTO, 1998, pp:299-303 [Conf]
- Yonatan Aumann, Michael O. Rabin
Information Theoretically Secure Communication in the Limited Storage Space Model. [Citation Graph (0, 0)][DBLP] CRYPTO, 1999, pp:65-79 [Conf]
- Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP] FOCS, 1997, pp:144-153 [Conf]
- Yonatan Aumann, Michael Ben-Or
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1991, pp:440-446 [Conf]
- Yonatan Aumann, Michael A. Bender
Fault Tolerant Data Structures. [Citation Graph (0, 0)][DBLP] FOCS, 1996, pp:580-589 [Conf]
- Yonatan Aumann, Zvi M. Kedem, Krishna V. Palem, Michael O. Rabin
Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs [Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:271-280 [Conf]
- Yonatan Aumann, Michael O. Rabin
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:147-156 [Conf]
- Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
Function Matching: Algorithms, Applications, and a Lower Bound. [Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:929-942 [Conf]
- Yonatan Aumann, Michael A. Bender
Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler. [Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:622-633 [Conf]
- Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults. [Citation Graph (0, 0)][DBLP] ICALP, 1994, pp:47-58 [Conf]
- Yonatan Aumann, Yehuda Lindell
A Statistical Theory for Quantitative Association Rules. [Citation Graph (0, 0)][DBLP] KDD, 1999, pp:261-270 [Conf]
- Ronen Feldman, Yonatan Aumann, Amihood Amir, Amir Zilberstein, Willi Klösgen
Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. [Citation Graph (0, 0)][DBLP] KDD, 1997, pp:167-170 [Conf]
- Ronen Feldman, Moshe Fresko, Haym Hirsh, Yonatan Aumann, Orly Liphstat, Yonatan Schler, Martin Rajman
Knowledge Management: A Text Mining Approach. [Citation Graph (0, 0)][DBLP] PAKM, 1998, pp:- [Conf]
- Yonatan Aumann, Ronen Feldman, Yaron Ben-Yehuda, David Landau, Orly Liphstat, Yonatan Schler
Circle Graphs: New Visualization Tools for Text-Mining. [Citation Graph (0, 0)][DBLP] PKDD, 1999, pp:277-282 [Conf]
- Ronen Feldman, Yonatan Aumann, Moshe Fresko, Orly Liphstat, Binyamin Rosenfeld, Yonatan Schler
Text Mining via Information Extraction. [Citation Graph (0, 0)][DBLP] PKDD, 1999, pp:165-173 [Conf]
- Ronen Feldman, Yonatan Aumann, Amir Zilberstein, Yaron Ben-Yehuda
Trend Graphs: Visualizing the Evolution of Concept Relationships in Large Document Collections. [Citation Graph (0, 0)][DBLP] PKDD, 1998, pp:38-46 [Conf]
- David Landau, Ronen Feldman, Yonatan Aumann, Moshe Fresko, Yehuda Lindell, Orly Liphstat, Oren Zamir
TextVis: An Integrated Visual Environment for Text Mining. [Citation Graph (0, 0)][DBLP] PKDD, 1998, pp:56-64 [Conf]
- Yonatan Aumann
Efficient Asynchronous Consensus with the Weak Adversary Scheduler. [Citation Graph (0, 0)][DBLP] PODC, 1997, pp:209-218 [Conf]
- Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
Linear Consistency Testing. [Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 1999, pp:109-120 [Conf]
- Doron Lipson, Yonatan Aumann, Amir Ben-Dor, Nathan Linial, Zohar Yakhini
Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis. [Citation Graph (0, 0)][DBLP] RECOMB, 2005, pp:83-100 [Conf]
- Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
Pattern matching with address errors: rearrangement distances. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:1221-1229 [Conf]
- Yonatan Aumann, Avivit Kapah-Levy
Cooperative Sharing and Asynchronous Consensus Using Single-Reader Single-Writer Registers. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:61-70 [Conf]
- Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
Dotted interval graphs and high throughput genotyping. [Citation Graph (0, 0)][DBLP] SODA, 2005, pp:339-348 [Conf]
- Yonatan Aumann, Yuval Rabani
Improved Bounds for All Optical Routing. [Citation Graph (0, 0)][DBLP] SODA, 1995, pp:567-576 [Conf]
- Yonatan Aumann, Michael A. Bender, Lisa Zhang
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. [Citation Graph (0, 0)][DBLP] SPAA, 1996, pp:270-276 [Conf]
- Yonatan Aumann, Michael Ben-Or
Computing with Faulty Arrays [Citation Graph (0, 0)][DBLP] STOC, 1992, pp:162-169 [Conf]
- Yonatan Aumann, Yehuda Lindell
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. [Citation Graph (0, 0)][DBLP] TCC, 2007, pp:137-156 [Conf]
- Yonatan Aumann, Efrat Manisterski, Zohar Yakhini
Designing Optimally Multiplexed SNP Genotyping Assays. [Citation Graph (0, 0)][DBLP] WABI, 2003, pp:320-338 [Conf]
- Doron Lipson, Zohar Yakhini, Yonatan Aumann
Optimization of probe coverage for high-resolution oligonucleotide aCGH. [Citation Graph (0, 0)][DBLP] Bioinformatics, 2007, v:23, n:2, pp:77-83 [Journal]
- Yonatan Aumann, Michael A. Bender
Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2005, v:17, n:3, pp:191-207 [Journal]
- Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
Linear Consistency Testing [Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:25, pp:- [Journal]
- Yonatan Aumann, Michael A. Bender, Lisa Zhang
Efficient Execution of Nondeterministic Parallel Programs on Asynchronous Systems. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:139, n:1, pp:1-16 [Journal]
- Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:37, n:2, pp:247-266 [Journal]
- Yonatan Aumann, Johan Håstad, Michael O. Rabin, Madhu Sudan
Linear-Consistency Testing. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:62, n:4, pp:589-607 [Journal]
- Yonatan Aumann, Efrat Manisterski, Zohar Yakhini
Designing optimally multiplexed SNP genotyping assays. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2005, v:70, n:3, pp:399-417 [Journal]
- Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko
Maximal Association Rules: A Tool for Mining Associations in Text. [Citation Graph (0, 0)][DBLP] J. Intell. Inf. Syst., 2005, v:25, n:3, pp:333-345 [Journal]
- Yonatan Aumann, Ronen Feldman, Orly Liphstat, Heikki Mannila
Borders: An Efficient Algorithm for Association Generation in Dynamic Databases. [Citation Graph (0, 0)][DBLP] J. Intell. Inf. Syst., 1999, v:12, n:1, pp:61-73 [Journal]
- Yonatan Aumann, Yehuda Lindell
A Statistical Theory for Quantitative Association Rules. [Citation Graph (0, 0)][DBLP] J. Intell. Inf. Syst., 2003, v:20, n:3, pp:255-283 [Journal]
- Yonatan Aumann, Assaf Schuster
Improved Memory Utilization in Deterministic PRAM Simulation. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1991, v:12, n:2, pp:146-151 [Journal]
- Yonatan Aumann, Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, Jonathan Schler
Visual information extraction. [Citation Graph (0, 0)][DBLP] Knowl. Inf. Syst., 2006, v:10, n:1, pp:1-15 [Journal]
- Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
Function Matching. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:35, n:5, pp:1007-1022 [Journal]
- Yonatan Aumann, Yuval Rabani
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:1, pp:291-301 [Journal]
- Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
On the cost of recomputing: Tight bounds on pebbling with faults. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:233, n:1-2, pp:247-261 [Journal]
- Yonatan Aumann, Michael O. Rabin
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:128, n:1&2, pp:3-30 [Journal]
- Yonatan Aumann, Yan Zong Ding, Michael O. Rabin
Everlasting security in the bounded storage model. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1668-1680 [Journal]
- Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
Finding Witnesses by Peeling. [Citation Graph (0, 0)][DBLP] CPM, 2007, pp:28-39 [Conf]
- Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
Efficient Computations of l1 and linfinity Rearrangement Distances. [Citation Graph (0, 0)][DBLP] SPIRE, 2007, pp:39-49 [Conf]
Physical Search Problems Applying Economic Search Models. [Citation Graph (, )][DBLP]
Evaluation of election outcomes under uncertainty. [Citation Graph (, )][DBLP]
Easy and hard coalition resource game formation problems: a parameterized complexity analysis. [Citation Graph (, )][DBLP]
On agent types in coalition formation problems. [Citation Graph (, )][DBLP]
Approximate String Matching with Address Bit Errors. [Citation Graph (, )][DBLP]
Quasi-distinct Parsing and Optimal Compression Methods. [Citation Graph (, )][DBLP]
Collaborative Multi Agent Physical Search with Probabilistic Knowledge. [Citation Graph (, )][DBLP]
Fixed Structure Complexity. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.456secs
|