70 search results - page 4 / 14 » The Ackermann Award 2007 |
96
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We pre...
132
Voted
CATS
1998
15 years 2 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
98
Voted
IM
2008
15 years 24 days ago
2008
Abstract. Congestion games are a well-studied model for resource sharing among uncoordinated selfish agents. Usually, one assumes that the resources in a congestion game do not hav...
92
Voted
ISAAC
2007
Springer
15 years 7 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
82
Voted
CORR
2007
Springer
15 years 23 days ago
2007
Springer
A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problem...