Sciweavers

796 search results - page 116 / 160
» The Anonymous Subgraph Problem
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
15 years 4 months ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
MST
2006
104views more  MST 2006»
14 years 12 months ago
Sequencing from Compomers: The Puzzle
The board game FragmindTM poses the following problem: The player has to reconstruct an (unknown) string s over the alphabet . To this end, the game reports the following informati...
Sebastian Böcker
FUN
2010
Springer
263views Algorithms» more  FUN 2010»
15 years 4 months ago
Fighting Censorship with Algorithms
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
Mohammad Mahdian
ATAL
2008
Springer
15 years 1 months ago
Undominated VCG redistribution mechanisms
Many important problems in multiagent systems can be seen as resource allocation problems. For such problems, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, in...
Mingyu Guo, Vincent Conitzer
TCS
2008
14 years 11 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas