We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
Constantinos Daskalakis, Christos H. Papadimitriou
In recent years, mathematical, statistical and computer science methods have found extensive application in developing new procedures for crime investigation, prosecution and the ...
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
We examine the use of Web services, an XML-based distributed object system, for developing reusable, interoperable services for computational science web portals. This paper descr...
Stephen Mock, Choon-Han Youn, Marlon E. Pierce, Ge...
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...