Follow

Submissions from 2023

PDF

An Undergraduate Consortium for Addressing the Leaky Pipeline to Computing Research, James C. Boerkoel Jr. and Mehmet Ergezer

Submissions from 2020

PDF

Dynamic Control of Probabilistic Simple Temporal Networks, James C. Boerkoel Jr., Michael Gao, and Lindsay Popowski

PDF

Quantifying controllability in temporal networks with uncertainty, James C. Boerkoel Jr., Lindsay Popowski, Michael Gao, Hemeng Li, Savana Ammons, and Shyan Akmal

Submissions from 2013

PDF

Exploring the Baccalaureate Origin of Domestic Ph.D. Students in Computing Fields, Susanne Hambrusch, Ran Libeskind-Hadas, Fen Zhao, David Rabson, Amy Csizmar Dalal, Ed Fox, Charles Isbell, and Valerie Taylor

Link

A First Course in Computing with Applications to Biology, Ran Libeskind-Hadas and Eliot Bush

PDF

Virtual Machine Workloads: The Case for New NAS Benchmarks, Vasily Tarasov, Dean Hildebrand, Geoffrey H. Kuenning, and Erez Zadok

Submissions from 2012

Link

Increasing Women's Participation in Computing at Harvey Mudd College, Christine Alvarado, Zachary Dodds, and Ran Libeskind-Hadas

Link

An Extreme Case of Plant-Insect Co-Diversification: Figs and Fig-Pollinating Wasps, Astrid Craud, Nina Ronsted, Bhanumas Chantarasuwan, Lien Siang Chou, Wendy L. Clement, Arnaud Couloux, Benjamin Cousins, Gwenaelle Genson, Rhett D. Harrison, Paul E. Hanson, Martine Hossaert-McKey, Roula Jabbour-Zahab, Emmanuelle Jousselin, Carole Kerdelhue, Finn Kiellberg, Carlos Lopez-Vaamonde, John Lee Thompson Peebles Jr. '13, Yan-Qiong Peng, Rodrigo Augusto Santinelo Pereira, Tselil Schramm '12, Rosichon Ubaidillah, Simon van Noort, George D. Weiblen, Da-Rong Yang, Anak Yodpinyanee '12, Ran Libeskind-Hadas, James M. Cook, Jean-Yves Rasplus, and Vincent Savolainen

Submissions from 2011

PDF

The Cophylogeny Reconstruction Problem is NP-Complete, Yaniv J. Ovadia '10, Daniel Fielder '11, Chris Conow, and Ran Libeskind-Hadas

Submissions from 2010

PDF

Learning to Create Jazz Melodies Using Deep Belief Nets, Greg Bickerman '10, Sam Bosley, Peter Swire, and Robert M. Keller

PDF

Jane: A New Tool for the Cophylogeny Reconstruction Problem, Chris Conow, Daniel Fielder '11, Yaniv J. Ovadia '10, and Ran Libeskind-Hadas

PDF

Figs, Wasps, Gophers, and Lice: A Computational Exploration of Coevolution, Ran Libeskind-Hadas

Submissions from 2009

PDF

On the Computational Complexity of the Reticulate Cophylogeny Reconstruction Problem, Ran Libeskind-Hadas and Michael A. Charleston

Submissions from 2008

Link

Competitive Analysis of Online Traffic Grooming in WDM Rings, Karyn Benson, Benjamin Birnbaum, Esteban Molina-Estolano '06, and Ran Libeskind-Hadas

Submissions from 2007

Link

Blues for Gary: Design Abstractions for a Jazz Improvisation Assistant, Robert M. Keller, Martin Hunt '08, Stephen Jones '07, David Morrison '08, and Aaron Wolin '07

PDF

Using Permuted States of Validated Simulation to Analyze Conflict Rates in Optimistic Replication, An-I Andy Wang, Geoffrey H. Kuenning, and Peter Reiher

Link

PARAID: A Gear-shifting Power-aware RAID, Charles Weddle, Mathew Oldham, Jin Qian, An-I Andy Wang, Peter Reiher, and Geoffrey H. Kuenning

Submissions from 2006

Link

Virtual Topologies for Multicasting with Multiple Originators in WDM Networks, Ian Ferrel '04, Adrian Mettler '04, Edward Miller '03, and Ran Libeskind-Hadas

Link

The Conquest File System: Better Performance through a Disk/persistent-RAM Hybrid Design, An-I Andy Wang, Geoffrey H. Kuenning, Peter Reiher, and Gerald J. Popek

Submissions from 2005

PDF

Grid-Enabling a Vibroacoustic Analysis Application, Brian Bentow, Jon Dodge, Aaron Homer, Christopher D. Moore, Robert M. Keller, Matthew T. Presley, Robert Davis, Jorge Seidel, Craig Lee, and Joseph Betser

Link

Fun and Games: A New Software Engineering Course, Elizabeth Sweedyk and Robert M. Keller

Submissions from 2004

Link

Optimal Virtual Topologies for One-to-Many Communication in WDM Paths and Rings, Jeff R.K. Hartline '01, Ran Libeskind-Hadas, Kurt M. Dresner '02, Ethan W. Drucker '02, and Katrina J. Ray '02

Link

Estimating Scale Up Cost Factors for Commercial Jet Planes, Christopher P. Holcomb and Donald S. Remer

Link

On the Complexity of Virtual Topology Design for Multicasting in WDM Trees With Tap-and-Continue and Multicast-Capable Switches, Edward Miller '03, Ran Libeskind-Hadas, Dustin Barnard '03, Will Chang '04, Kurt M. Dresner '02, Wesley Turner '03, and Jeff R.K. Hartline '01

Link

Electric-Field-Based Routing: A Reliable Framework for Routing in MANETs, Nam T. Nguyen, An-I Andy Wang, Peter Reiher, and Geoffrey H. Kuenning

Submissions from 2003

PDF

Enabling Computer Decisions Based on EEG Input, Benjamin J. Culpepper and Robert M. Keller

PDF

The Computational Complexity of Motion Planning, Jeff R.K. Hartline '01 and Ran Libeskind-Hadas

Submissions from 2002

Link

Multicast Routing and Wavelength Assignment in Multi-Hop Optical Networks, Ran Libeskind-Hadas and Rami Melhem

Submissions from 2001

PDF

Proof Without Words: The Pigeonhole Principle, Ran Libeskind-Hadas

Link

On Multicast Algorithms for Heterogeneous Networks of Workstations, Ran Libeskind-Hadas, Jeff R.K. Hartline '01, Peter Boothe '00, Greg Rae '00, and Jascha Swisher '00

PDF

Multicast Communication in Circuit-Switched Optical Networks, Ran Libeskind-Hadas and Rami Melhem

Link

Replication Requirements in Mobile Environments, David Ratner, Peter Reiher, Gerald J. Popek, and Geoffrey H. Kuenning

Submissions from 2000

PDF

Efficient Multicast in Heterogeneous Networks of Workstations, Ran Libeskind-Hadas and Jeff R.K. Hartline '01

Submissions from 1999

Link

On Edge-Disjoint Spanning Trees in Hypercubes, Benjamin Barden '99, Ran Libeskind-Hadas, Janet Davis '99, and William Williams '99

Submissions from 1998

Link

A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing, Ran Libeskind-Hadas

PDF

Sorting in Parallel, Ran Libeskind-Hadas

PDF

Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations, Ran Libeskind-Hadas, Dominic Mazzoni '99, and Ranjith Rajagopalan '99

PDF

Tree-Based Multicasting in Wormhole-Routed Irregular Topologies, Ran Libeskind-Hadas, Dominic Mazzoni '99, and Ranjith Rajagopalan '99

Link

Perspectives on Optimistically Replicated, Peer-to-Peer Filing, Thomas W. Page Jr., Robert G. Guy, John S. Heidemann, David H. Ratner, Peter Reiher, Ashvin Goel, and Geoffrey H. Kuenning

Link

Saving Portable Computer Battery Power through Remote Process Execution, Alexey Rudenko, Peter Reiher, Gerald J. Popek, and Geoffrey H. Kuenning

Submissions from 1997

Link

Experience with an Automated Hoarding System, Geoffrey H. Kuenning, Peter Reiher, and Gerald J. Popek

PDF

Adaptive Multicast Routing in Wormhole Networks, Ran Libeskind-Hadas, Tom Hehre '96, Andrew Hutchings '98, Mark Reyes '98, and Kevin Watkins '97

Submissions from 1995

Link

Kitrace: Precise Interactive Measurement of Operating Systems Kernels, Geoffrey H. Kuenning

PDF

Approximation Algorithms: Good Solutions to Hard Problems, Ran Libeskind-Hadas

Link

Origin-Based Fault Tolerant Routing in the Mesh, Ran Libeskind-Hadas and Eli Brandt '95

Link

Optimal Reconfiguration Algorithms for Real-Time Fault Tolerant Processor Arrays, Ran Libeskind-Hadas, Nimish Shrivastava, Rami Melhem, and C.L. Liu

Submissions from 1991

PDF

Disjoint Covers in Replicated Heterogeneous Arrays, P.K. McKinley, N. Hasan, Ran Libeskind-Hadas, and C.L. Liu

Submissions from 1989

Link

Semantics and Implementation of Resource Expressions, Robert M. Keller and Bharat Jayaraman

Submissions from 1987

Link

Overview of Rediflow II Development, Robert M. Keller, Jon W. Slater, and Kevin T. Likes

PDF

The Gradient Model Load Balancing Method, Frank C. H. Lin and Robert M. Keller

Submissions from 1986

Link

Primitives for Resource Management in a Demand-Driven Reduction Model, Bharat Jayaraman and Robert M. Keller

Link

Semantics of Digital Networks Containing Indeterminate Modules, Robert M. Keller and Prakash Panangaden

Link

Applicative Caching, Robert M. Keller and M Ronan Sleep

PDF

Distributed Recovery in Applicative Systems, Frank C. H. Lin and Robert M. Keller

Submissions from 1985

Link

Distributed Computation by Graph Reduction, Robert M. Keller

PDF

Approaching Distributed Database Implementations Through Functional Programming Concepts, Robert M. Keller and Gary Lindstrom

Submissions from 1984

PDF

Consistency Testing for Data-Flow Circuits, Chu S. Jhon and Robert M. Keller

PDF

Simulated Performance of a Reduction-Based Multiprocessing System, Robert M. Keller and Frank C. H. Lin

Link

Static Inference of Properties of Applicative Programs, Prateek Mishra and Robert M. Keller

Submissions from 1983

PDF

Specification of Synchronizing Processes, Krithivasan Ramamritham and Robert M. Keller

Submissions from 1982

PDF

Data Flow Program Graphs, Alan L. Davis and Robert M. Keller

Link

Garbage Collection and Task Deletion in Distributed Applicative Processing Systems, Paul Hudak and Robert M. Keller

Submissions from 1981

Link

Applications of Feedback in Functional Programming, Robert M. Keller and Gary Lindstrom

Link

On Synchronization and Its Specification, Krithivasan Ramamritham and Robert M. Keller

PDF

Specifying and Proving Properties of Sentinels, Krithivasan Ramamritham and Robert M. Keller

Submissions from 1980

Link

Divide and CONCer: Data Structuring in Applicative Multi-Processing Systems, Robert M. Keller

Link

Some Theoretical Aspects of Applicative Multiprocessing, Robert M. Keller

Submissions from 1979

Link

A Loosely-coupled Applicative Multi-Processing System, Robert M. Keller, Gary Lindstrom, and Suhas Patil

Submissions from 1976

Link

Formal Verification of Parallel Programs, Robert M. Keller

Submissions from 1975

Link

A Fundamental Theorem of Asynchronous Parallel Computation, Robert M. Keller

Link

Look-Ahead Processors, Robert M. Keller

Submissions from 1973

Link

Some Approaches to Best-Match File Searching, Walter A. Burkhard and Robert M. Keller

Link

Parallel Program Schemata and Maximal Parallelism I. Fundamental Results, Robert M. Keller

Link

Parallel Program Schemata and Maximal Parallelism I. Fundamental Results, Robert M. Keller

Link

Parallel Program Schemata and Maximal Parallelism II: Construction of Closures, Robert M. Keller

Link

Parallel Program Schemata and Maximal Parallelism II: Construction of Closures, Robert M. Keller

PDF

A Novel Method of Constructing Sorting Networks, Robert M. Keller

Submissions from 1972

Link

On the Decomposition of Asynchronous Systems, Robert M. Keller

PDF

On the Decomposition of Asynchronous Systems, Robert M. Keller

Submissions from 1970

Link

On Maximally Parallel Schemata, Robert M. Keller

PDF

On Maximally Parallel Schemata, Robert M. Keller