Fundamental Problems in Computing

Publications

2013

Zoran Ivkovic, Errol L. Lloyd
Fully Dynamic Bin Packing. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
System Level Concurrency Control for Distributed Database Systems. Fundamental Problems in Computing (2013)
Lin Yu, Daniel J. Rosenkrantz
Representability of Design Objects by Ancestor-Controlled Hierarchical Specifications. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz
Matrix Equations and Normal Forms for Context-Free Grammars. Fundamental Problems in Computing (2013)
Richard Edwin Stearns, Harry B. Hunt III
Sums-of-Products and Subproblem Independence. Fundamental Problems in Computing (2013)
Thomas C. O'Connell
A Survey of Graph Algorithms Under Extended Streaming Models of Computation. Fundamental Problems in Computing (2013)
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
An analysis of several heuristics for the traveling salesman problem. Fundamental Problems in Computing (2013)
Sven O. Krumke, Rob van Stee, Stephan Westphal
Online Job Admission. Fundamental Problems in Computing (2013)
Yuri Breitbart, Henry F. Korth, Avi Silberschatz
An Optimistic Concurrency Control Protocol for Replicated Databases. Fundamental Problems in Computing (2013)
Philip J. Bernhard, Daniel J. Rosenkrantz
An efficient method for representing and transmitting message patterns on multiprocessor interconnection networks. Fundamental Problems in Computing (2013)
Christopher L. Barrett, Keith R. Bisset, Jiangzhuo Chen, Stephen G. Eubank, Bryan L. Lewis, V. S. Anil Kumar, Madhav V. Marathe, Henning S. Mortveit
Interactions among human behavior, social networks, and societal infrastructures: A Case Study in Computational Epidemiology. Fundamental Problems in Computing (2013)
Parvathi Chundi, Daniel J. Rosenkrantz
Efficient Algorithms for Segmentation of Item-Set Time Series. Fundamental Problems in Computing (2013)
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
A Richer Understanding of the Complexity of Election Systems. Fundamental Problems in Computing (2013)
Philip M. Lewis, Daniel J. Rosenkrantz, Richard Edwin Stearns
Attributed Translations. Fundamental Problems in Computing (2013)
Philip M. Lewis
SNAPSHOT Isolation: Why Do Some People Call it SERIALIZABLE? Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Harry B. Hunt III
The Complexity of Processing Hierarchical Specifications. Fundamental Problems in Computing (2013)
Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis
Consistency and serializability in concurrent database systems. Fundamental Problems in Computing (2013)