| 2026 | ESA | Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces. | Noam Licht, Ilan Newman, Yuri Rabinovich |
| 2026 | SODA | Testing forbidden order-pattern properties on hypergrids. | Harish Chandramouleeswaran, Ilan Newman, Tomer Pelleg, Nithin Varma |
| 2024 | STOC | Hardness Condensation by Restriction. | Mika Gs, Ilan Newman, Artur Riazanov, Dmitry Sokolov |
| 2022 | ICALP | Strongly Sublinear Algorithms for Testing Pattern Freeness. | Ilan Newman, Nithin Varma |
| 2021 | ICALP | New Sublinear Algorithms and Lower Bounds for LIS Estimation. | Ilan Newman, Nithin Varma |
| 2017 | SODA | Testing for Forbidden Order Patterns in an Array. | Ilan Newman, Yuri Rabinovich, Deepak Rajendraprasad, Christian Sohler |
| 2012 | SODA | On multiplicative λ-approximations and some geometric applications. | Ilan Newman, Yuri Rabinovich |
| 2011 | STOC | Every property of hyperfinite graphs is testable. | Ilan Newman, Christian Sohler |
| 2009 | CPM | LCS Approximation via Embedding into Local Non-repetitive Strings. | Gad M. Landau, Avivit Levy, Ilan Newman |
| 2009 | SAGT | A New Derandomization of Auctions. | Oren Ben-Zwi, Ilan Newman, Guy Wolfovitz |
| 2007 | STACS | Hard Metrics from Cayley Graphs of Abelian Groups. | Ilan Newman, Yuri Rabinovich |
| 2007 | WADS | The Stackelberg Minimum Spanning Tree Game. | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenal Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
| 2006 | SODA | Local versus global properties of metric spaces. | Sanjeev Arora, Lszl Lovsz, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh S. Vempala |
| 2006 | STOC | A combinatorial characterization of the testable graph properties: it's all about regularity. | Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapira |
| 2005 | STOC | Testing versus estimation of graph properties. | Eldar Fischer, Ilan Newman |
| 2005 | STACS | Increasing Kolmogorov Complexity. | Harry Buhrman, Lance Fortnow, Ilan Newman, Nikolai K. Vereshchagin |
| 2005 | STACS | Robust Polynomials and Quantum Algorithms. | Harry Buhrman, Ilan Newman, Hein Rhrig, Ronald de Wolf |
| 2003 | SODA | Quantum property testing. | Harry Buhrman, Lance Fortnow, Ilan Newman, Hein Rhrig |
| 2003 | SODA | Embedding k-outerplanar graphs into l1. | Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
| 2003 | SODA | Sublinear-time approximation of Euclidean minimum spanning tree. | Artur Czumaj, Funda Ergn, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler |
| 2002 | STOC | Monotonicity testing over general poset domains. | Eldar Fischer, Eric P. Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky |
| 2001 | STOC | Testing of matrix properties. | Eldar Fischer, Ilan Newman |
| 2000 | FOCS | Testing of Functions that have small width Branching Programs. | Ilan Newman |
| 1999 | FOCS | Regular Languages Are Testable with a Constant Number of Queries. | Noga Alon, Michael Krivelevich, Ilan Newman, Mario Szegedy |
| 1999 | FOCS | Cuts, Trees and l | Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
| 1999 | SPAA | Communication-Processor Tradeoffs in Limited Resources PRAM. | Adnan Agbaria, Yosi Ben-Asher, Ilan Newman |
| 1998 | HiPC | Broadcasting on a budget in the multi-service communication model. | Gene Itkis, Ilan Newman, Assaf Schuster |
| 1997 | SODA | Optimal Search in Trees: Extended Abstract + Appendix. | Yosi Ben-Asher, Eitan Farchi, Ilan Newman |
| 1996 | STOC | Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract). | Ilan Newman, Mario Szegedy |
| 1995 | ESA | Self-Simulation for the Passive Optical Star Model. | Pascal Berthom, Th. Duboux, Torben Hagerup, Ilan Newman, Assaf Schuster |
| 1991 | FOCS | Search Problems in the Decision Tree Model (Preliminary Version) | Lszl Lovsz, Moni Naor, Ilan Newman, Avi Wigderson |