Prabhakar Ragde

Available identifiers

zbMath Open ragde.prabhakar-lMaRDI QIDQ919821

List of research outcomes

Publication	Date of Publication	Type
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs	2023-01-18	Paper
Retrieval of scattered information by EREW, CREW and CRCW PRAMs	2022-12-09	Paper
FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT	2015-04-29	Paper
Faster fixed-parameter tractable algorithms for matching and packing problems	2008-12-02	Paper
On the parameterized complexity of layered graph drawing	2008-12-02	Paper
Solving \#SAT using vertex covers	2007-12-10	Paper
Solving #SAT Using Vertex Covers	2007-09-04	Paper
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs	2007-05-29	Paper
Algorithms and Data Structures	2006-10-25	Paper
A fixed-parameter approach to 2-layer planarization	2006-08-11	Paper
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover	2005-12-27	Paper
Parameterized and Exact Computation	2005-08-23	Paper
Algorithms – ESA 2004	2005-08-18	Paper
Embeddings of \(k\)-connected graphs of pathwidth \(k\)	2005-02-22	Paper
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors	2004-10-01	Paper
https://portal.mardi4nfdi.de/entity/Q3043700	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4796197	2003-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q4778544	2002-11-18	Paper
On Graph Powers for Leaf-Labeled Trees	2002-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q2721972	2001-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q2721973	2001-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q4944989	2000-03-22	Paper
Characterizing multiterminal flow networks and computing flows in networks of small treewidth	1999-02-21	Paper
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains	1998-11-24	Paper
Pointers versus arithmetic in PRAMs	1997-03-31	Paper
https://portal.mardi4nfdi.de/entity/Q4886100	1996-08-22	Paper
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs	1996-05-27	Paper
Parallel Algorithms with Processor Failures and Delays	1996-02-20	Paper
The Parallel Simplicity of Compaction and Chaining	1993-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4038731	1993-05-18	Paper
Analysis of an asynchronous PRAM algorithm	1992-06-28	Paper
Processor-time tradeoffs in PRAM simulations	1992-06-28	Paper
Linear-size constant-depth polylog-threshold circuits	1992-06-27	Paper
Incomparability in parallel computation	1990-01-01	Paper
On the power of concurrent-write PRAMs with read-only memory	1989-01-01	Paper
On separating the EREW and CREW PRAM models	1989-01-01	Paper
A bidirectional shortest-path algorithm with good average-case behavior	1989-01-01	Paper
Simulations among concurrent-write PRAMs	1988-01-01	Paper
Relations between Concurrent-Write Models of Parallel Computation	1988-01-01	Paper
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3746901	1985-01-01	Paper
Rational Chebyshev approximations for the Bessel functions 𝐽₀(𝑥), 𝐽₁(𝑥), 𝑌₀(𝑥), 𝑌₁(𝑥)	1982-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Prabhakar Ragde