The following pages link to Prabhakar Ragde (Q919821):
Displaying 43 items.
- (Q582087) (redirect page) (← links)
- On the power of concurrent-write PRAMs with read-only memory (Q582089) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- Faster fixed-parameter tractable algorithms for matching and packing problems (Q958209) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Simulations among concurrent-write PRAMs (Q1104097) (← links)
- On separating the EREW and CREW PRAM models (Q1124343) (← links)
- Linear-size constant-depth polylog-threshold circuits (Q1182085) (← links)
- Analysis of an asynchronous PRAM algorithm (Q1183402) (← links)
- Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- Pointers versus arithmetic in PRAMs (Q1816730) (← links)
- A bidirectional shortest-path algorithm with good average-case behavior (Q1823692) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Retrieval of scattered information by EREW, CREW, and CRCW PRAMs (Q1904664) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- (Q2721972) (← links)
- (Q2721973) (← links)
- On Graph Powers for Leaf-Labeled Trees (Q2777607) (← links)
- (Q3043700) (← links)
- Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs (Q3438969) (← links)
- (Q3746901) (← links)
- Relations between Concurrent-Write Models of Parallel Computation (Q3798244) (← links)
- The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$ (Q3802607) (← links)
- Rational Chebyshev approximations for the Bessel functions 𝐽₀(𝑥), 𝐽₁(𝑥), 𝑌₀(𝑥), 𝑌₁(𝑥) (Q3956299) (← links)
- (Q4038731) (← links)
- Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains (Q4209262) (← links)
- The Parallel Simplicity of Compaction and Chaining (Q4696646) (← links)
- (Q4778544) (← links)
- (Q4796197) (← links)
- Parallel Algorithms with Processor Failures and Delays (Q4864434) (← links)
- (Q4886100) (← links)
- (Q4944989) (← links)
- Retrieval of scattered information by EREW, CREW and CRCW PRAMs (Q5056126) (← links)
- Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs (Q5060111) (← links)
- FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT (Q5249050) (← links)
- Parameterized and Exact Computation (Q5311505) (← links)
- Algorithms and Data Structures (Q5394241) (← links)
- Algorithms – ESA 2004 (Q5464589) (← links)
- Solving #SAT Using Vertex Covers (Q5756553) (← links)
