The following pages link to Ilan Newman (Q430842):
Displaying 50 items.
- Hierarchy theorems for property testing (Q430844) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Testing periodicity (Q534782) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Lower bounds for testing Euclidean minimum spanning trees (Q846011) (← links)
- Partitioning multi-dimensional sets in a small number of ``uniform'' parts (Q854815) (← links)
- Space complexity vs. query complexity (Q937195) (← links)
- On grid intersection graphs (Q1174140) (← links)
- Private vs. common random bits in communication complexity (Q1182120) (← links)
- On read-once threshold formulae and their randomized decision tree complexity (Q1208407) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Geometric approach for optimal routing on a mesh with buses (Q1362339) (← links)
- Extremal hypercuts and shadows of simplicial complexes (Q1717600) (← links)
- Communication-processor tradeoffs in a limited resources PRAM (Q1849381) (← links)
- A lower bound on the distortion of embedding planar metrics into Euclidean space (Q1864139) (← links)
- Decision trees with Boolean threshold queries (Q1908341) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes (Q2040016) (← links)
- On connectivity of the facet graphs of simplicial complexes (Q2279942) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Testing of matrix-poset properties (Q2460630) (← links)
- Robust polynomials and quantum algorithms (Q2643136) (← links)
- Regular Languages are Testable with a Constant Number of Queries (Q2706138) (← links)
- On Multiplicative $\lambda$-Approximations and Some Geometric Applications (Q2848204) (← links)
- Every Property of Hyperfinite Graphs Is Testable (Q2848211) (← links)
- Local Versus Global Properties of Metric Spaces (Q2884582) (← links)
- A combinatorial characterization of the testable graph properties (Q2931390) (← links)
- (Q3002805) (← links)
- Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight (Q3032100) (← links)
- Computing in fault tolerant broadcast networks and noisy decision trees (Q3055759) (← links)
- Randomized Single-Target Hot-Potato Routing (Q3128988) (← links)
- Testing Membership in Languages that Have Small Width Branching Programs (Q3149882) (← links)
- On the query complexity of testing orientations for being Eulerian (Q3189056) (← links)
- Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs (Q3507528) (← links)
- Quantum Property Testing (Q3532569) (← links)
- On the Query Complexity of Testing Orientations for Being Eulerian (Q3541809) (← links)
- Monotonicity testing over general poset domains (Q3579209) (← links)
- Testing versus estimation of graph properties (Q3581386) (← links)
- Local versus global properties of metric spaces (Q3581570) (← links)
- Constant Approximation Algorithms for Embedding Graph Metrics into Trees and Outerplanar Graphs (Q3588402) (← links)
- Hard Metrics from Cayley Graphs of Abelian Groups (Q3590931) (← links)
- Space Complexity vs. Query Complexity (Q3595382) (← links)
- Testing st-Connectivity (Q3603479) (← links)
- The Stackelberg Minimum Spanning Tree Game (Q3603515) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Hierarchy Theorems for Property Testing (Q3638900) (← links)
