Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001.
The focus of this chapter is on the Gen...
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
An annotator’s classification of a text not only tells us something about the intent of the text’s author, it also tells us something about the annotator’s standpoint. To un...
Kenneth R. Fleischmann, Thomas Clay Templeton, Jor...
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...