- Increasing Kolmogorov Complexity Harry Buhrman1,2
- Lower Bounds on Formula Size of Boolean Functions using HypergraphEntropy
- Lower Bounds for Testing Euclidean Minimum Spanning Trees Oren BenZwi # Oded Lachish + Ilan Newman #
- Cuts, Trees and ` 1 Embeddings of Graphs (Preliminary Version)
- Search Problems in the Decision Tree Model L'aszl'o Lov'asz \Lambda
- Proposed running title: Decision Trees with Boolean Threshold queries Mailing address
- On ReadOnce Threshold Formulae and their Randomized Decision Tree Complexity
- Computing in Fault Tolerant Broadcast Networks and Noisy Decision Trees
- Functions that have readtwice constant width branching programs are not necessarily testable
- Space Complexity vs. Query Complexity Oded Lachish
- Efficient Approximation of Large LCS in Strings Over Not Small Alphabet
- Combinatorial Characterization of ReadOnce M. Karchmer \Lambda
- TESTING MEMBERSHIP IN LANGUAGES THAT HAVE SMALL WIDTH BRANCHING PROGRAMS
- Geometric Approach for Optimal Routing on Mesh with Buses Yosi BenAsher
- Nondeterministic Communication Complexity with Few Witnesses
- Private vs. Common Random bits in Communication Complexity
- Quantum Property Testing z Harry Buhrman x Lance Fortnow { Ilan Newman k Hein Rohrig x
- On the Query Complexity of Testing Orientations for being Eulerian
- Testing of matrixposet properties # Eldar Fischer + Ilan Newman #
- SublinearTime Approximation of Euclidean Minimum Spanning Tree Artur Czumaj Funda Ergun y Lance Fortnow z . Avner Magen x Ilan Newman {
- Public vs. Private coin flips in one round communication games (Extended Abstract )
- Regular Languages are Testable with a Constant Number of Queries Noga Alon #
- Every Property of Hyperfinite Graphs is Testable [Extended Abstract]
- TESTING VERSUS ESTIMATION OF GRAPH PROPERTIES # ELDAR FISCHER + AND ILAN NEWMAN #
- Embedding kOuterplanar Graphs into ` 1 Chandra Chekuri \Lambda Anupam Gupta y Ilan Newman z Yuri Rabinovich z Alistair Sinclair x
- Optimal Search in Trees \Lambda Yosi BenAsher, y Eitan Farchi, z Ilan Newman x ,
- Testing of Matrix Properties Eldar Fischer
- Randomized SingleTarget HotPotato Routing \Lambday Ishai Ben Aroya z Ilan Newman x Assaf Schuster --
- [9] M. Golin and A. Schuster. Optimal PointtoPoint Broadcast Algorithms via Lopsided Trees. In Proc. 5th Israeli Symp. on Theory of Computing and Systems, pages 63--73, 1997. To appear in Disc. Appl.
- Testing Periodicity Oded Lachish1
- An Exact Almost Optimal Algorithm for Target Set Selection in Social Networks
- Hard Metric from Cayley Graphs Yuri Rabinovich
- Constant approximation algorithms for embedding graph metrics into trees and
- A New Derandomization of Auctions Oren Ben-Zwi, Ilan Newman, and Guy Wolfovitz
- The Stackelberg Minimum Spanning Tree Game Jean Cardinal1
- Space Complexity vs. Query Complexity Oded Lachish1
- A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
- Partitioning multi-dimensional sets in a small number of "uniform" parts
- Robust Polynomials and Quantum Algorithms Harry Buhrman
- Testing Periodicity Oded Lachish
- Communication-Processor Tradeo s in Limited Resources PRAM
- Testing versus Estimation of Graph Properties Extended Abstract + Appendix
- SelfSimulation for the Passive Optical Star \Lambday Pascal Berthom'e z Torben Hagerup x Ilan Newman --Assaf Schuster k
- Local versus Global Properties of Metric Spaces Extended abstract
- Functions that have read-twice constant width branching programs are not necessarily testable
- A lower bound on the distortion of embedding planar metrics into Euclidean space
- Quantum Property Testing z Harry Buhrman x Lance Fortnow { Ilan Newman k Hein Rohrig
- Computing in fault tolerance broadcast networks Ilan Newman
- Efficient testing of bipartite graphs for forbidden induced subgraphs Eldar Fischer
- Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time #
- Cuts, Trees and ` 1 -Embeddings of Graphs Anupam Gupta y Ilan Newman z Yuri Rabinovich z Alistair Sinclair x
- On Multiplicative -Approximations and Some Geometric Applications Ilan Newman
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs1
- SIAM J. COMPUT. c 2012 Society for Industrial and Applied Mathematics Vol. 0, No. 0, pp. 000000
