Prabhakar Ragde

57 papers A* 7A 5B 5Journal 28Unranked 12

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Review of "Algorithms for Functional Programming" by John David Stone, Springer-Verlag, 2018. J. Funct. Program. Prabhakar Ragde
2016	—	`conf`	Proust: A Nano Proof Assistant. TFPIE Prabhakar Ragde
2014	—	`conf`	Simple Balanced Binary Search Trees. TFPIE Prabhakar Ragde
2012	—	`conf`	Mathematics Is Imprecise TFPIE Prabhakar Ragde
2008	J	`jnl`	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2008	J	`jnl`	On the Parameterized Complexity of Layered Graph Drawing. Algorithmica Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
2008	—	`conf`	The chilling descent: making the transition to a conventional curriculum. FDPE@ICFP Prabhakar Ragde
2007	J	`jnl`	Solving #SAT using vertex covers. Acta Informatica Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2006	J	`jnl`	A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2006	A	`conf`	Solving #SAT Using Vertex Covers. SAT Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2005	J	`jnl`	Embeddings of Discret. Appl. Math. Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2005	J	`jnl`	Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2005	B	`conf`	Parameterized Counting Algorithms for General Graph Covering Problems. WADS Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2004	J	`jnl`	Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2004	A	`conf`	Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2004	A	`conf`	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
2004	—	`conf`	Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2003	—	`conf`	On the parameterized complexity of the generalized rush hour puzzle. CCCG Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
2002	J	`jnl`	On Graph Powers for Leaf-Labeled Trees. J. Algorithms Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2001	A	`conf`	A Fixed-Parameter Approach to Two-Layer Planarization. GD Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2001	B	`conf`	Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2001	J	`jnl`	Fast approximation schemes for K Electron. Notes Discret. Math. Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2001	A	`conf`	On the Parameterized Complexity of Layered Graph Drawing. ESA Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood
2000	—	`conf`	Complexity Theory and Algorithms. Euro-Par Friedhelm Meyer auf der Heide, Miroslaw Kutylowski, Prabhakar Ragde
2000	—	`conf`	Embeddings of SWAT Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
2000	J	`jnl`	Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2000	—	`conf`	On Graph Powers for Leaf-Labeled Trees. SWAT Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
1999	B	`conf`	Finding Smallest Supertrees Under Minor Containment. WG Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
1998	J	`jnl`	Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
1998	J	`jnl`	Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. J. Algorithms Omer Berkman, Yossi Matias, Prabhakar Ragde
1996	J	`jnl`	Parallel Algorithms with Processor Failures and Delays. J. Algorithms Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
1996	A*	`conf`	Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
1996	J	`jnl`	Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
1996	B	`conf`	µDatabase: Parallelism in a Memory-Mapped Environment. SPAA Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
1995	A*	`conf`	Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
1995	J	`jnl`	Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs. Comput. Complex. Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
1993	—	`conf`	Pointers versus Arithmetic in PRAMs. SCT Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
1993	J	`jnl`	The Parallel Simplicity of Compaction and Chaining. J. Algorithms Prabhakar Ragde
1993	B	`conf`	Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS Omer Berkman, Yossi Matias, Prabhakar Ragde
1992	J	`jnl`	Processor-Time Tradeoffs in PRAM Simulations. J. Comput. Syst. Sci. Prabhakar Ragde
1992	—	`conf`	Retrieval of scattered information by EREW, CREW and CRCW PRAMs. SWAT Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
1991	J	`jnl`	Analysis of an Asynchronous PRAM Algorithm. Inf. Process. Lett. Prabhakar Ragde
1991	J	`jnl`	Extracting Poetry from Technical Paper s. SIGACT News Prabhakar Ragde
1991	J	`jnl`	Linear-Size Constant-Depth Polylog-Treshold Circuits. Inf. Process. Lett. Prabhakar Ragde, Avi Wigderson
1990	J	`jnl`	Incomparability in parallel computation. Discret. Appl. Math. Vince Grolmusz, Prabhakar Ragde
1990	—	`conf`	Perfect Hashing, Graph Entropy, and Circuit Complexity. SCT Ilan Newman, Prabhakar Ragde, Avi Wigderson
1990	A*	`conf`	The Parallel Simplicity of Compaction and Chaining. ICALP Prabhakar Ragde
1989	J	`jnl`	A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior. Algorithmica Michael Luby, Prabhakar Ragde
1989	J	`jnl`	On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. Eli Gafni, Joseph Naor, Prabhakar Ragde
1989	J	`jnl`	On the Power of Concurrent-Write PRAMs With Read-Only Memory Inf. Comput. Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha
1988	J	`jnl`	Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. Faith E. Fich, Prabhakar Ragde, Avi Wigderson
1988	J	`jnl`	Simulations Among Concurrent-Write PRAMs. Algorithmica Faith E. Fich, Prabhakar Ragde, Avi Wigderson
1988	J	`jnl`	The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discret. Math. Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
1987	A*	`conf`	Incomparability in Parallel Computation FOCS Vince Grolmusz, Prabhakar Ragde
1985	A*	`conf`	A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). ICALP Michael Luby, Prabhakar Ragde
1985	A*	`conf`	One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation STOC Faith E. Fich, Friedhelm Meyer auf der Heide, Prabhakar Ragde, Avi Wigderson
1984	A*	`conf`	Relations Between Concurrent-Write Models of Parallel Computation. PODC Faith E. Fich, Prabhakar Ragde, Avi Wigderson