Streaming Computation of Delaunay TriangulationsJonathan Richard ShewchukComputer Science DivisionUniversity of California at BerkeleyWe show how to compute Delaunay triangulations of utterly huge,well-distributed point sets in 2D and 3D on an ordinary computer by exploitingthe natural spatial coherence in a stream of points. We achieve…

Srinivasa Rao SattiMADALGOSuccinct representations of treesAbstract:Trees are one of the most fundamental structures in computing. They areused in almost every aspect of modeling and representation for explicitcomputations. Standard representations of trees using pointers are quitewasteful of space, and could account for the dominant space cost…

Tetrahedral Meshes with Good Dihedral AnglesJonathan ShewchukComputer Science DivisionUniversity of California at Berkeley(Joint work with Francois Labelleand Bryan Klingner)We develop two new methods for creating high-quality tetrahedral meshes:one with guaranteed good dihedral angles, and one that in practice producesfar better dihedral angles…

Title: A two value passing call-by-name CPS transformationDate: Wednesday 19 SeptemberTime 11:15-12:00Location: Turing-014Speaker: Xinxin Liu Laboratory of Computer Science Institute of Software Chinese Academy of ScienceAbstract: In this talk we present a CPS encoding for the call-by-name lambda calculus.This encoding improves Plotkin's…

Title: Policy-Informed Program AnalysesAbstract:Access-control policies play a central role in controlling thedissemination of sensitive data in domains ranging from libraryservices to healthcare. They representan important but not isolatedexample of policies or rules that govern the behavior of programs.Developers increasingly extract these…

Title: Programming Languages for Interactive ApplicationsAbstract:Web and graphical applications lend themselves to natural expressionin an event-driven, dataflow style. This style is especially valuablewhen itlayers reactivity transparently atop a traditional programminglanguage. It has become especially necessary and valuable with theadvent of…

A probabilistic study of the RESTART scheme forfailure recovery.Søren Asmussen, IMF, AULester Lipsky, Dept. of Computer Science, Storss, CTConsider a task like the execution of a computer programor a file transfer that may fail before being completed.Standard schemes for failure recovery are RESUME (continueafter repair), REPLACE (start a new task…

Secure multiparty computation allows n participants to compute an agreedfunction securely, such that noinformation is revealed about the input ofthe function,other than what is revealed by the function itself. Thisthesis will present a Java based implementation of multiparty protocols with communication complexity O(C*n)*k + O(D*n^2)*k +…