The following pages link to Nisheeth K. Vishnoi (Q430833):
Displaying 50 items.
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- The mixing time of the Dikin walk in a polytope -- a simple proof (Q1755831) (← links)
- Iteratively reweighted least squares and slime mold dynamics: connection and convergence (Q2149565) (← links)
- On the Computational Complexity of Limit Cycles in Dynamical Systems (Q2800588) (← links)
- Integrality gaps for sparsest cut and minimum linear arrangement problems (Q2931416) (← links)
- Making evolution rigorous (Q2986858) (← links)
- Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696) (← links)
- Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration (Q3387758) (← links)
- (Q3549678) (← links)
- Improved Algorithm for Degree Bounded Survivable Network Design Problem (Q3569909) (← links)
- (Q4329139) (← links)
- (Q4451064) (← links)
- (Q4471369) (← links)
- Evolutionary Dynamics in Finite Populations Mix Rapidly (Q4575613) (← links)
- Natural Algorithms for Flow Problems (Q4575715) (← links)
- Mixing Time of Markov Chains, Dynamical Systems and Evolution (Q4598202) (← links)
- A Dynamics for Advertising on Networks (Q4614060) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- (Q4828981) (← links)
- Real stable polynomials and matroids: optimization and counting (Q4977986) (← links)
- Algorithms for Convex Optimization (Q4997179) (← links)
- On the Complexity of Constrained Determinantal Point Processes (Q5002639) (← links)
- Ranking with Fairness Constraints (Q5002698) (← links)
- (Q5002753) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5009328) (← links)
- (Q5009519) (← links)
- On the Computability of Continuous Maximum Entropy Distributions with Applications (Q5048289) (← links)
- On the computability of continuous maximum entropy distributions with applications (Q5144978) (← links)
- Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal (Q5145024) (← links)
- Faster Algorithms via Approximation Theory (Q5167553) (← links)
- Dynamic sampling from graphical models (Q5212847) (← links)
- Belief Propagation, Bethe Approximation and Polynomials (Q5224078) (← links)
- On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) (Q5236236) (← links)
- Entropy, optimization and counting (Q5259538) (← links)
- Caching with Expiration Times for Internet Applications (Q5291244) (← links)
- The Speed of Evolution (Q5363055) (← links)
- (Q5365058) (← links)
- (Q5365061) (← links)
- (Q5365139) (← links)
- A Distributed Learning Dynamics in Social Groups (Q5369000) (← links)
- Lx = b (Q5396760) (← links)
- (Q5405192) (← links)
- 2 <sup> log1-ε <i>n</i> </sup> hardness for the closest vector problem with preprocessing (Q5415481) (← links)
- Approximating the exponential, the lanczos method and an Õ(<i>m</i>)-time spectral algorithm for balanced separator (Q5415541) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465857) (← links)
- The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ <sub>1</sub> (Q5501953) (← links)
- Dynamic Sampling from Graphical Models (Q5858642) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
