Sciweavers

1209 search results - page 180 / 242
» Universal Algebra and Computer Science
Sort
View
CCS
2007
ACM
15 years 8 months ago
Blacklistable anonymous credentials: blocking misbehaving users without ttps
Several credential systems have been proposed in which users can authenticate to services anonymously. Since anonymity can give users the license to misbehave, some variants allow...
Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. ...
161
Voted
FOCS
2006
IEEE
15 years 8 months ago
Strategic Network Formation through Peering and Service Agreements
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
FOCS
2005
IEEE
15 years 8 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
GD
2005
Springer
15 years 8 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 6 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...