Searching for authors named "Ilan Newman" – sorted by Relevance.
-
Testing membership in languages that have small width branching programs
- –1570 TESTING MEMBERSHIP IN LANGUAGES THAT HAVE SMALL WIDTH BRANCHING PROGRAMS ∗ ILAN NEWMAN † Abstract
- Cited by 13 (3 self) – Add To MetaCart
-
Private vs. Common Random bits in Communication Complexity
- Private vs. Common Random bits in Communication Complexity Ilan Newman November 8, 1995 Abstract
- Cited by 51 (0 self) – Add To MetaCart
-
Lower Bounds on Formula Size of Boolean Functions using Hypergraph-Entropy
- Lower Bounds on Formula Size of Boolean Functions using Hypergraph-Entropy Ilan Newman Avi
- Cited by 3 (0 self) – Add To MetaCart
-
Public vs. Private coin flips in one round communication games (Extended Abstract)
- Public vs. Private coin flips in one round communication games (Extended Abstract ) Ilan Newman
- Cited by 19 (0 self) – Add To MetaCart
-
Testing of Matrix Properties
- Testing of Matrix Properties Eldar Fischer Ilan Newman y July 3, 2001 Abstract Combinatorial
- Cited by 18 (7 self) – Add To MetaCart
-
Testing versus estimation of graph properties
- Testing versus estimation of graph properties*# Eldar Fischer ## Ilan Newman $ September 19
- Cited by 16 (5 self) – Add To MetaCart
-
Self-Simulation for the Passive Optical Star
- Self-Simulation for the Passive Optical Star y Pascal Berthom'e z Torben Hagerup x Ilan Newman
- Add To MetaCart
-
Cuts, Trees and l 1 -Embeddings of Graphs
- Cuts, Trees and ` 1 -Embeddings of Graphs (Preliminary Version) Anupam Gupta Ilan Newman y
- Cited by 15 (2 self) – Add To MetaCart
-
On Read-Once Threshold Formulae and their Randomized Decision Tree Complexity
- On Read-Once Threshold Formulae and their Randomized Decision Tree Complexity Rafi Heiman Ilan
- Cited by 12 (0 self) – Add To MetaCart
-
Search Problems in the Decision Tree Model
- Search Problems in the Decision Tree Model L'aszl'o Lov'asz Moni Naor y Ilan Newman z Avi
- Cited by 9 (0 self) – Add To MetaCart

