Sciweavers

167 search results - page 28 / 34
» An electronic voting system supporting vote weights
Sort
View
AAAI
2006
14 years 10 months ago
The Complexity of Bribery in Elections
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by a certain amount of bribing voter...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
CORR
2006
Springer
154views Education» more  CORR 2006»
14 years 9 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...
FPL
2005
Springer
97views Hardware» more  FPL 2005»
15 years 3 months ago
Safe PLD-based Programmable Controllers
In many industrial processes, an incorrect operation can lead to irreparable damage to people, equipment, or the environment. In order to reduce risks, the electronic control syst...
Jacobo Alvarez, Jorge Marcos, Santiago Fernandez
VLDB
2004
ACM
105views Database» more  VLDB 2004»
15 years 2 months ago
Tamper Detection in Audit Logs
Audit logs are considered good practice for business systems, and are required by federal regulations for secure systems, drug approval data, medical information disclosure, fina...
Richard T. Snodgrass, Shilong (Stanley) Yao, Chris...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
15 years 9 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah