Travelled to:1 × Canada
1 × Greece
4 × USA
Collaborated with:E.Fischer C.Sohler M.Szegedy N.Alon A.Shapira E.Lehman S.Raskhodnikova R.Rubinfeld A.Samorodnitsky
Talks about:properti (4) graph (3) test (3) testabl (2) combinatori (1) hyperfinit (1) character (1) communic (1) regular (1) monoton (1)
Person: Ilan Newman
DBLP: Newman:Ilan
Contributed to:
201120062005200220011996Wrote 6 papers:
- STOC-2011-NewmanS #graph
- Every property of hyperfinite graphs is testable (IN, CS), pp. 675–684.
- STOC-2006-Shapira #all about #combinator #graph
- A combinatorial characterization of the testable graph properties: it’s all about regularity (NA, EF, IN, AS), pp. 251–260.
- STOC-2005-FischerN #estimation #graph #testing
- Testing versus estimation of graph properties (EF, IN), pp. 138–146.
- STOC-2002-FischerLNRRS #testing
- Monotonicity testing over general poset domains (EF, EL, IN, SR, RR, AS), pp. 474–483.
- STOC-2001-FischerN #matrix #testing
- Testing of matrix properties (EF, IN), pp. 286–295.
- STOC-1996-NewmanS #communication #game studies
- Public vs. Private Coin Flips in One Round Communication Games (IN, MS), pp. 561–570.