Secure Open Systems for Protecting Privacy and Digital Services (2008)
David Kravitz, Kim-ee Yeoh, Nicol So
This paper describes and analyzes a system architecture that enables consumers to access services and content from multiple providers without jeopardizing the privacy interests of consumers or the...
RANDOM 2-SAT Does not depend on a giant (2008)
Here we introduce a new model for random 2−SAT. It is wellknown that on the standard model there is a sharp phase transition, the probability of satisfiability quickly drops as the number of...
On an Online Random k-SAT model (2008)
Given n Boolean variables x1,..., xn, a k-clause is a disjunction of k literals, where a literal is a variable or its negation. Suppose random k-clauses are generated one at a time and an online...
Avoiding a giant component (2006)
Let c be a constant and (e1, f1), (e2, f2),..., (ecn, fcn) be a sequence of ordered pairs of edges on vertex set [n] chosen uniformly and independently at random. Let A be an algorithm for the...
Creating a Giant Component \Lambda (2004)
In addition, we establish a lower bound on the time of emergence of a giant component in any process produced by an on-line algorithm and show that there is a phase transition for the off-line...
On the Irregularity Strength of Trees (2004)
For any graph G, let ni be the number of vertices of degree i, and}. This is a general lower bound on the λ(G) = maxi≤j { ni+···+nj+i−1 j irregularity strength of graph G. All known facts...
A New Ultimate Convex Hull Algorithm in R² (2000)
Uwe Rösler, William Steiger, David Kravitz
We present a very simple algorithm - NEWHULL - to find the convex hull of S = {P 1 , . . . , Pn}, n given points in R 2 . It may be thought of as a variant of Quickhull; however if the hull of S has...
Two Comments on Minimum Spanning Trees (1998)
Minimum spanning trees in graphs are well-studied objects. In this note we want to share our observations of two of their properties which we believe are not as well known as others. Although they...
Trustee-based Tracing Extensions to Anonymous Cash and the Making of Anonymous Change (1995)
Ernie Brickell, Peter Gemmell, David Kravitz
Electronic cash is a subject of great economic, political, and research importance. With advances in computer networks, in processor speed, and in databases and with advances in note counterfeiting...
Thesis (M. Ed.)--Millersville State College, 1972.