The following pages link to Prabhakar Raghavan (Q222782):
Displaying 50 items.
- Some results of Christos Papadimitriou on internet structure, network routing, and web information (Q458485) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- Time-space tradeoffs for undirected graph traversal by graph automata (Q675049) (← links)
- Query strategies for priced information (Q696973) (← links)
- Multiterminal global routing: A deterministic approximation scheme (Q916369) (← links)
- (Q1106722) (redirect page) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Probabilistic construction of deterministic algorithms: approximating packing integer programs (Q1112724) (← links)
- Multidimensional on-line bin packing: Algorithms and worst-case analysis (Q1123131) (← links)
- Deferred data structure for the nearest neighbor problem (Q1183453) (← links)
- Optimal time bounds for some proximity problems in the plane (Q1198024) (← links)
- Integer programming in VLSI design (Q1201818) (← links)
- Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
- Randomized query processing in robot path planning (Q1273861) (← links)
- Combinatorial and experimental results for randomized point matching algorithms (Q1286470) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Auditing Boolean attributes (Q1394802) (← links)
- Latent semantic indexing: A probabilistic analysis (Q1591153) (← links)
- Multidimensional cube packing (Q1762987) (← links)
- Parallel graph algorithms that are efficients on average (Q1825648) (← links)
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. (Q1853151) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- Random walks with ``back buttons'' (Q1872455) (← links)
- Competitive paging with locality of reference (Q1892219) (← links)
- (Q2729063) (← links)
- (Q2741480) (← links)
- Efficient routing in all-optical networks (Q2817603) (← links)
- The minimum latency problem (Q2817608) (← links)
- On targeting Markov segments (Q2819538) (← links)
- (Q2913803) (← links)
- Adversarial queuing theory (Q2947002) (← links)
- (Q3138977) (← links)
- Random walks on weighted graphs and applications to on-line algorithms (Q3140012) (← links)
- Randomized algorithms and pseudorandom numbers (Q3140013) (← links)
- Random walks with “back buttons” (extended abstract) (Q3192018) (← links)
- Query strategies for priced information (extended abstract) (Q3192028) (← links)
- Randomized broadcast in networks (Q3197297) (← links)
- Using PageRank to Characterize Web Structure (Q3431003) (← links)
- Introduction to Information Retrieval (Q3532845) (← links)
- Competitive recommendation systems (Q3579179) (← links)
- Deferred Data Structuring (Q3813273) (← links)
- (Q4010309) (← links)
- (Q4010315) (← links)
- (Q4010318) (← links)
- Stochastic Contention Resolution With Short Delays (Q4210173) (← links)
- (Q4226450) (← links)
- (Q4228428) (← links)
- (Q4228430) (← links)
- (Q4228491) (← links)
- A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata (Q4229423) (← links)
