Prabhakar Ragde

From MaRDI portal
Revision as of 08:10, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Prabhakar Ragde to Prabhakar Ragde: Duplicate)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)

Person:919821

Available identifiers

zbMath Open ragde.prabhakar-lMaRDI QIDQ919821

List of research outcomes





PublicationDate of PublicationType
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs2023-01-18Paper
Retrieval of scattered information by EREW, CREW and CRCW PRAMs2022-12-09Paper
FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT2015-04-29Paper
Faster fixed-parameter tractable algorithms for matching and packing problems2008-12-02Paper
On the parameterized complexity of layered graph drawing2008-12-02Paper
Solving \#SAT using vertex covers2007-12-10Paper
Solving #SAT Using Vertex Covers2007-09-04Paper
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs2007-05-29Paper
Algorithms and Data Structures2006-10-25Paper
A fixed-parameter approach to 2-layer planarization2006-08-11Paper
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover2005-12-27Paper
Parameterized and Exact Computation2005-08-23Paper
Algorithms โ€“ ESA 20042005-08-18Paper
Embeddings of \(k\)-connected graphs of pathwidth \(k\)2005-02-22Paper
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors2004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q30437002004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q47961972003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q47785442002-11-18Paper
On Graph Powers for Leaf-Labeled Trees2002-03-07Paper
https://portal.mardi4nfdi.de/entity/Q27219722001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27219732001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q49449892000-03-22Paper
Characterizing multiterminal flow networks and computing flows in networks of small treewidth1999-02-21Paper
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains1998-11-24Paper
Pointers versus arithmetic in PRAMs1997-03-31Paper
https://portal.mardi4nfdi.de/entity/Q48861001996-08-22Paper
Retrieval of scattered information by EREW, CREW, and CRCW PRAMs1996-05-27Paper
Parallel Algorithms with Processor Failures and Delays1996-02-20Paper
The Parallel Simplicity of Compaction and Chaining1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40387311993-05-18Paper
Analysis of an asynchronous PRAM algorithm1992-06-28Paper
Processor-time tradeoffs in PRAM simulations1992-06-28Paper
Linear-size constant-depth polylog-threshold circuits1992-06-27Paper
Incomparability in parallel computation1990-01-01Paper
On the power of concurrent-write PRAMs with read-only memory1989-01-01Paper
On separating the EREW and CREW PRAM models1989-01-01Paper
A bidirectional shortest-path algorithm with good average-case behavior1989-01-01Paper
Simulations among concurrent-write PRAMs1988-01-01Paper
Relations between Concurrent-Write Models of Parallel Computation1988-01-01Paper
The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37469011985-01-01Paper
Rational Chebyshev approximations for the Bessel functions ๐ฝโ‚€(๐‘ฅ), ๐ฝโ‚(๐‘ฅ), ๐‘Œโ‚€(๐‘ฅ), ๐‘Œโ‚(๐‘ฅ)1982-01-01Paper

Research outcomes over time

This page was built for person: Prabhakar Ragde