500 search results - page 46 / 100 » On the Hardness of Being Truthful |
148
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
199
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
158
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
152
click to vote
AE
2001
Springer
15 years 10 months ago
2001
Springer
This is a time of increasing interdisciplinary research. Computer science is learning more from biology every day, enabling a plethora of new software techniques to flourish. And b...
261
click to vote
ACISP
2000
Springer
15 years 10 months ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...