( en | de | ru )

 

Disambiguation of "Newman, Ilan"

Author of the publication

copydeleteadd this publication to your clipboard
Strongly Sublinear Algorithms for Testing Pattern Freeness.

, and . ICALP, volume 229 of LIPIcs, page 98:1-98:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ilan Moradi

Dragutin Ilan i

Ilan Katz

Ilan Wolff

Ilan Golan

 

Other publications of authors with the same name

Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract)., and . STOC, page 561-570. ACM, (1996)An exact almost optimal algorithm for target set selection in social networks., , , and . EC, page 355-362. ACM, (2009)Testing of matrix properties., and . STOC, page 286-295. ACM, (2001)Hard Metrics from Cayley Graphs of Abelian Groups., and . STACS, volume 4393 of Lecture Notes in Computer Science, page 157-162. Springer, (2007)On the formula complexity of simple Boolean functions (על סבוכיות הנסחא של פונקציות בוליאניות פשוטות.).. Hebrew University of Jerusalem, Israel, (1991)Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable., and . CCC, page 73-79. IEEE Computer Society, (2002)Search Problems in the Decision Tree Model (Preliminary Version), , , and . FOCS, page 576-585. IEEE Computer Society, (1991)Broadcasting on a budget in the multi-service communication model., , and . HiPC, page 163-170. IEEE Computer Society, (1998)Geometric approach for optimal routing on mesh with buses., and . SPDP, page 145-152. IEEE, (1995)Regular Languages Are Testable with a Constant Number of Queries., , , and . FOCS, page 645-655. IEEE Computer Society, (1999)