Travelled to:1 × Canada
1 × Germany
1 × Israel
1 × The Netherlands
5 × USA
Collaborated with:R.Feldman B.Rosenfeld Y.Lindell M.A.Bender M.Ben-Or A.Amir J.Bar-Ilan U.Feige M.Fresko J.Schler R.Cole M.Lewenstein E.Porat A.Zilberstein W.Klösgen Y.Liberzon K.Ankori Y.Schler
Talks about:extract (3) document (2) inform (2) associ (2) bound (2) rule (2) consensus (1) asynchron (1) algorithm (1) adversari (1)
Person: Yonatan Aumann
DBLP: Aumann:Yonatan
Contributed to:
2004
200320022001
1999199719961994
1992Wrote 9 papers:
- CIKM-2004-RosenfeldFFSA #approach #hybrid #information management #named
- TEG: a hybrid approach to information extraction (BR, RF, MF, JS, YA), pp. 589–596.
- ICALP-2003-AmirACLP #algorithm #bound
- Function Matching: Algorithms, Applications, and a Lower Bound (AA, YA, RC, ML, EP), pp. 929–942.
- CIKM-2002-RosenfeldFA #documentation #layout #visual notation
- Structural extraction from visual layout of documents (BR, RF, YA), pp. 203–210.
- CIKM-2001-FeldmanALASR #independence #information management
- A Domain Independent Environment for Creating Information Extraction Modules (RF, YA, YL, KA, YS, BR), pp. 586–588.
- KDD-1999-AumannL #statistics
- A Statistical Theory for Quantitative Association Rules (YA, YL), pp. 261–270.
- KDD-1997-FeldmanAAZK #documentation #keyword #mining
- Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections (RF, YA, AA, AZ, WK), pp. 167–170.
- ICALP-1996-AumannB #performance
- Efficient Asynchronous Consensus with the Value-Oblivious Adversary Scheduler (YA, MAB), pp. 622–633.
- ICALP-1994-AumannBF #bound #cost analysis #fault #on the
- On the Cost of Recomputing: Tight Bounds on Pebbling with Faults (YA, JBI, UF), pp. 47–58.
- STOC-1992-AumannB #array
- Computing with Faulty Arrays (YA, MBO), pp. 162–169.