 | 2009 |
|---|
| 11 |       | Gábor Erdélyi,
Henning Fernau,
Judy Goldsmith,
Nicholas Mattei,
Daniel Raible,
Jörg Rothe:
The Complexity of Probabilistic Lobbying.
ADT 2009: 86-97 |
| 10 | | Gábor Erdélyi,
Henning Fernau,
Judy Goldsmith,
Nicholas Mattei,
Daniel Raible,
Jörg Rothe:
The Complexity of Probabilistic Lobbying
CoRR abs/0906.4431: (2009) |
| 9 | | Gábor Erdélyi,
Lane A. Hemaspaandra,
Jörg Rothe,
Holger Spakowski:
Frequency of correctness versus average polynomial time.
Inf. Process. Lett. 109(16): 946-949 (2009) |
| 8 | | Gábor Erdélyi,
Lane A. Hemaspaandra,
Jörg Rothe,
Holger Spakowski:
Generalized juntas and NP-hard sets.
Theor. Comput. Sci. 410(38-40): 3995-4000 (2009) |
| 2008 |
|---|
| 7 | | Gábor Erdélyi,
Markus Nowak,
Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control.
MFCS 2008: 311-322 |
| 6 | | Gábor Erdélyi,
Markus Nowak,
Jörg Rothe:
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
CoRR abs/0806.0535: (2008) |
| 5 | | Gábor Erdélyi,
Lane A. Hemaspaandra,
Jörg Rothe,
Holger Spakowski:
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas
CoRR abs/0806.2555: (2008) |
| 2007 |
|---|
| 4 | | Gábor Erdélyi,
Lane A. Hemaspaandra,
Jörg Rothe,
Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.
FCT 2007: 300-311 |
| 3 | | Dagmar Bruß,
Gábor Erdélyi,
Tim Meyer,
Tobias Riege,
Jörg Rothe:
Quantum cryptography: A survey.
ACM Comput. Surv. 39(2): (2007) |
| 2 | | Gábor Erdélyi,
Lane A. Hemaspaandra,
Jörg Rothe,
Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time
CoRR abs/cs/0703097: (2007) |
| 2005 |
|---|
| 1 | | Gábor Erdélyi,
Tobias Riege,
Jörg Rothe:
Quantum Cryptography: A Survey
Electronic Colloquium on Computational Complexity (ECCC)(146): (2005) |
