Prabhakar Ragde

J. Funct. Program., 2020

2016

Proust: A Nano Proof Assistant.

[BibT_eX]

[DOI]

Proceedings of the 4th and 5th International Workshop on Trends in Functional Programming in Education, 2016

2014

Simple Balanced Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 3rd International Workshop on Trends in Functional Programming in Education, 2014

2013

OCaml from the Very Beginning, by John Whitington, Coherent Press, 2013, £ 25.99, US $37.99. ISBN-10: 0957671105 (paperback), 204 pp.

[BibT_eX]

[DOI]

J. Funct. Program., 2013

2012

Mathematics Is Imprecise

[BibT_eX]

[DOI]

Proceedings of the Proceedings First International Workshop on Trends in Functional Programming in Education, 2012

2008

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.

[BibT_eX]

[DOI]

Sue Whitesides

Algorithmica, 2008

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Algorithmica, 2008

The chilling descent: making the transition to a conventional curriculum.

[BibT_eX]

[DOI]

Proceedings of the 2008 international workshop on Functional and declarative programming in education, 2008

2007

Solving #SAT using vertex covers.

[BibT_eX]

[DOI]

Stefan Szeider

Acta Informatica, 2007

2006

A Fixed-Parameter Approach to 2-Layer Planarization.

[BibT_eX]

[DOI]

Algorithmica, 2006

2005

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Embeddings of k-connected graphs of pathwidth k.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Parameterized Counting Algorithms for General Graph Covering Problems.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

2004

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors.

[BibT_eX]

[DOI]

Erik D. Demaine

J. Comput. Syst. Sci., 2004

Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

[BibT_eX]

[DOI]

Stefan Szeider

Proceedings of the SAT 2004, 2004

Smaller Kernels for Hitting Set Problems of Constant Arity.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, First International Workshop, 2004

2003

On the parameterized complexity of the generalized rush hour puzzle.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

On Graph Powers for Leaf-Labeled Trees.

[BibT_eX]

[DOI]

Mohammad Taghi Hajiaghayi

J. Algorithms, 2002

2001

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

A Fixed-Parameter Approach to Two-Layer Planarization.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

On the Parameterized Complexity of Layered Graph Drawing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Finding Smallest Supertrees Under Minor Containment.

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Int. J. Found. Comput. Sci., 2000

Complexity Theory and Algorithms.

[BibT_eX]

[DOI]

Miroslaw Kutylowski

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1998

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains.

[BibT_eX]

[DOI]

Omer Berkman

Yossi Matias

J. Algorithms, 1998

1996

Pointers versus Arithmetic in PRAMs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Parallel Algorithms with Processor Failures and Delays.

[BibT_eX]

[DOI]

Jonathan F. Buss

Paris C. Kanellakis

Alexander A. Shvartsman

J. Algorithms, 1996

µDatabase: Parallelism in a Memory-Mapped Environment.

[BibT_eX]

[DOI]

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

Parallel Pointer-Based Join Algorithms in Memory-mapped Environments.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

1995

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.

[BibT_eX]

[DOI]

Comput. Complex., 1995

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1993

The Parallel Simplicity of Compaction and Chaining.

[BibT_eX]

[DOI]

J. Algorithms, 1993

Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs.

[BibT_eX]

[DOI]

Omer Berkman

Yossi Matias

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

1992

Processor-Time Tradeoffs in PRAM Simulations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1992

1991

Extracting Poetry from Technical Paper s.

[BibT_eX]

[DOI]

SIGACT News, 1991

Linear-Size Constant-Depth Polylog-Treshold Circuits.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Analysis of an Asynchronous PRAM Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1990

Incomparability in parallel computation.

[BibT_eX]

[DOI]

Vince Grolmusz

Discret. Appl. Math., 1990

Perfect Hashing, Graph Entropy, and Circuit Complexity.

[BibT_eX]

[DOI]

Ilan Newman

Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990

1989

On the Power of Concurrent-Write PRAMs With Read-Only Memory

[BibT_eX]

[DOI]

Inf. Comput., November, 1989

On Separating the Erew and Crew Pram Models.

[BibT_eX]

[DOI]

Eli Gafni

Joseph Naor

Theor. Comput. Sci., 1989

A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior.

[BibT_eX]

[DOI]

Michael Luby

Algorithmica, 1989

1988

The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

Relations Between Concurrent-Write Models of Parallel Computation.

[BibT_eX]

[DOI]

Faith E. Fich

SIAM J. Comput., 1988

Simulations Among Concurrent-Write PRAMs.

[BibT_eX]

[DOI]

Faith E. Fich

Friedhelm Meyer auf der Heide

Algorithmica, 1988

1985

One, Two, Three \dots Infinity: Lower Bounds for Parallel Computation

[BibT_eX]

[DOI]

Faith E. Fich

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version).

[BibT_eX]

[DOI]

Michael Luby