|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 4 keywords
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gábor Erdélyi, Michael R. Fellows, Lena Piras, Jörg Rothe |
Control Complexity in Bucklin and Fallback Voting  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dorothea Baumeister, Gábor Erdélyi, Jörg Rothe |
How Hard Is it to Bribe the Judges? A Study of the Complexity of Bribery in Judgment Aggregation. |
ADT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lena Piras, Jörg Rothe |
The complexity of voter partition in Bucklin and fallback voting: solving three open problems. |
AAMAS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lena Piras, Jörg Rothe |
Bucklin Voting is Broadly Resistant to Control |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Michael R. Fellows |
Parameterized Control Complexity in Fallback Voting |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lena Piras, Jörg Rothe |
Control Complexity in Fallback Voting |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi |
The control complexity of sincere strategy preference based approval voting and of fallback voting, and a study of optimal lobbying and Junta distributions for SAT. |
|
2009 |
RDF |
|
| 1 | Gábor Erdélyi, Markus Nowak, Jörg Rothe |
Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control. |
Math. Log. Q. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski |
Frequency of correctness versus average polynomial time. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski |
Generalized juntas and NP-hard sets. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe |
The Complexity of Probabilistic Lobbying |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Henning Fernau, Judy Goldsmith, Nicholas Mattei, Daniel Raible, Jörg Rothe |
The Complexity of Probabilistic Lobbying. |
ADT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski |
Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gábor Erdélyi, Markus Nowak, Jörg Rothe |
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
approval voting, complexity of procedural control, artificial intelligence, Complexity theory |
| 1 | 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 |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe |
Quantum cryptography: A survey. |
ACM Comput. Surv. |
2007 |
DBLP DOI BibTeX RDF |
Quantum bit commitment, quantum cryptography, quantum key distribution |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Erdélyi, Tobias Riege, Jörg Rothe |
Quantum Cryptography: A Survey |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")