The following pages link to Rajeev Motwani (Q6480591):
Displaying 1 item.
- (Q878746) (redirect page) (← links)
- (Q679449) (redirect page) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- The price of validity in dynamic networks (Q878747) (← links)
- Covering orthogonal polygons with star polygons: The perfect graph approach (Q918225) (← links)
- Finding large cycles in Hamiltonian graphs (Q972323) (← links)
- On the graph turnpike problem (Q989483) (← links)
- A combinatorial algorithm for MAX CSP (Q1007550) (← links)
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- Randomized query processing in robot path planning (Q1273861) (← links)
- Approximating probability distributions using small sample spaces (Q1288906) (← links)
- Nonclairvoyant scheduling (Q1331961) (← links)
- Computing roots of graphs is hard (Q1336641) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- On certificates and lookahead in dynamic graph problems (Q1393083) (← links)
- Modeling correlations in web traces and implications for designing replacement policies (Q1886610) (← links)
- Combining request scheduling with web caching (Q1887085) (← links)
- Combinatorial and experimental methods for approximate point pattern matching (Q1889585) (← links)
- Clique partitions, graph compression and speeding-up algorithms (Q1900930) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- Scale-free aggregation in sensor networks (Q2575090) (← links)
- Derandomization through approximation (Q2817641) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- (Q2913814) (← links)
- (Q2921667) (← links)
- Querying priced information in databases (Q2944545) (← links)
- (Q3138917) (← links)
- (Q3140446) (← links)
- Approximating the Longest Cycle Problem in Sparse Graphs (Q3149885) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- (Q3191564) (← links)
- On the decidability of accessibility problems (extended abstract) (Q3191998) (← links)
- Finding long paths and cycles in sparse Hamiltonian graphs (Q3192021) (← links)
- Computing the median with uncertainty (Q3192032) (← links)
- Computing shortest paths with uncertainty (Q3437091) (← links)
- Lower Bounds on Locality Sensitive Hashing (Q3544242) (← links)
- Fractional Matching Via Balls-and-Bins (Q3595378) (← links)
- (Q3601534) (← links)
- Deferred Data Structuring (Q3813273) (← links)
- Perfect Graphs and Orthogonally Convex Covers (Q3828050) (← links)
- Approximate graph coloring by semidefinite programming (Q3841651) (← links)
- A Linear Time Approach to the Set Maxima Problem (Q3989007) (← links)
- Realization of Matrices and Directed Graphs (Q4209274) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- (Q4226450) (← links)
- (Q4228228) (← links)
- (Q4228486) (← links)
- (Q4230322) (← links)
- (Q4234082) (← links)
- (Q4250208) (← links)
- (Q4252321) (← links)
- (Q4252385) (← links)
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) (Q4268701) (← links)
- Approximating Capacitated Routing and Delivery Problems (Q4268861) (← links)
- Average-case analysis of algorithms for matchings and related problems (Q4327634) (← links)
- An $\NC$ Algorithm for Minimum Cuts (Q4337444) (← links)
- The Robot Localization Problem (Q4376162) (← links)
- (Q4418664) (← links)
- (Q4418665) (← links)
- Online Scheduling with Lookahead: Multipass Assembly Lines (Q4427353) (← links)
- List Partitions (Q4443101) (← links)
- (Q4499940) (← links)
- (Q4506483) (← links)
- (Q4527029) (← links)
- (Q4527030) (← links)
- (Q4542583) (← links)
- Incremental Clustering and Dynamic Information Retrieval (Q4651519) (← links)
- Probabilistic Analysis of Network Flow Algorithms (Q4697084) (← links)
- Computing the Median with Uncertainty (Q4706217) (← links)
- Maintaining Stream Statistics over Sliding Windows (Q4785622) (← links)
- Worst-case time bounds for coloring and satisfiability problems (Q4806606) (← links)
- (Q4828920) (← links)
- (Q4828994) (← links)
- (Q4828995) (← links)
- Tail bounds for occupancy and the satisfiability threshold conjecture (Q4847396) (← links)
- (Q4848595) (← links)
- (Q4856179) (← links)
- (Q4875189) (← links)
- (Q4875229) (← links)
- (Q4942235) (← links)
- The Angular-Metric Traveling Salesman Problem (Q4943841) (← links)
- (Q4952715) (← links)
- On approximating the longest path in a graph (Q5060133) (← links)
- Visibility-based pursuit-evasion in a polygonal environment (Q5096922) (← links)
- Constrained TSP and low-power computing (Q5096929) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)
- Distinct Values Estimators for Power Law Distributions (Q5233150) (← links)
- Algorithmic Aspects of Wireless Sensor Networks (Q5312968) (← links)
- Database Theory - ICDT 2005 (Q5316594) (← links)
- Database Theory - ICDT 2005 (Q5316598) (← links)
- Database Theory - ICDT 2005 (Q5316618) (← links)
- (Q5417603) (← links)
- Estimating Sum by Weighted Sampling (Q5428797) (← links)
- Automata, Languages and Programming (Q5466539) (← links)
- The load rebalancing problem (Q5483511) (← links)
- A simple approach for pricing equity options with Markov switching state variables (Q5484634) (← links)
- (Q5501305) (← links)
- (Q5501799) (← links)
- Stable husbands (Q5750860) (← links)
