skip to main content
10.1145/778348acmconferencesBook PagePublication PagespckConference Proceedingsconference-collections
PCK50: Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
ACM2003 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
PCK50: Principles of Computing Knowledge: Paris C. Kanellakis Memorial Workshop San Diego California USA 8 June 2003
ISBN:
978-1-58113-604-3
Published:
08 June 2003
Sponsors:
Recommend ACM DL
ALREADY A SUBSCRIBER?SIGN IN

Reflects downloads up to 13 Feb 2025Bibliometrics
Skip Abstract Section
Abstract

These proceedings accompany the Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. This one-day meeting, held in the year of Paris Kanellakis's 50th birthday, commemorates Paris's legacy to computer science. It is a retrospective of his work and a celebration of his impact on computer science, through his research and through its influence on research directions taken by the computer science community. The workshop is affiliated with the ACM Federated Computing Research Conference held in San Diego, California, June 7--14, 2003.The workshop includes talks by invited speakers as well as by Paris's past students. The day will be capped by a banquet at which colleagues and friends will offer their personal recollections of Paris. Highlights of the workshop include invited talks by Dr. Christos Papadimitriou, University of California at Berkeley, Dr. Moshe Vardi, Rice University, and the winner of the ACM 2001 Paris Kanellakis Theory and Practice Award, Dr. Gene Myers of the University of California at Berkeley. This volume also includes four papers contributed by Paris's colleagues.

Skip Table Of Content Section
Article
Advances in DNA sequencing

Paired-read shotgun sequencing of a genome consists of randomly sampling segments of a fixed length, say 10,000 base pairs (10Kbp), and directly determining a "read" of 500 to 700bp at the two ends of each segment with an automated DNA sequencing ...

Article
The new problems

The Brown web site announcing the death of Paris Kanellakis was one of the 90,000 active websites, running on one of 13 million IP servers. Since that time, the Internet and the worldwide web have grown by several orders of magnitude, and they have ...

Article
A call to regularity

From the mid 1980s to the mid 1990s, with the active involvement of Paris C. Kanellakis, a major theme in database theory was the study of Datalog, the language of logic programs without function symbols. Unfortunately, most decision problems involving ...

Article
A retrospective on constraint databases

In this paper we give a review of constraint databases, a field that was started by Paris Kanellakis, Gabriel Kuper and the author. The review includes basic concepts of data representation, constraint query languages, and query evaluation. We also ...

Article
Static reasoning about programs and queries

In this paper, I survey three projects that are loosely related by the aim to statically understand important properties of a computation. First I describe an extension to mainstream programming languages that solves some common expressiveness ...

Article
Parallel digital halftoning by error-diffusion

Digital halftoning, or dithering, is the technique commonly used to render a color or grayscale image on a printer, a computer monitor or other bi-level displays. A particular halftoning technique that has been used extensively in the past is the so-...

Article
Extending the constraint database framework

Constraint Databases (CDBs) are an extension of relational databases that enrich both the relational data model and the relational query primitives with constraints. By providing a finite representation of data with infinite semantics, the Constraint ...

Article
On the computational complexity of bisimulation, redux
Article
distributed cooperation and adversity: complexity trade-offs

The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such perturbations can be caused by ...

Article
From CTL to datalog

We provide a translation from CTL to DatalogSucc. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and its various fragments. c) It uses a fragment of DatalogSucc which is close to ...

Article
The side-chain positioning problem: a semidefinite programming formulation with new rounding schemes

Side-chain positioning is a central component of the protein structure prediction problem and has been the focus of a large body of research. The problem is NP-complete; in fact, it is even inapproximable. In practice, it is tackled by a variety of ...

Article
Comet in context

Combinatorial optimization problems naturally arise in many application areas, including logistics, manufacturing, supply-chain management, and resource allocation. They often give rise to complex and intricate programs, because of their inherent ...

Contributors
  • Brown University
  • University of Connecticut
  • Stony Brook University
  • Brown University

Recommendations