| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Dorothea Baumeister, Jörg Rothe |
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Online Voter Control in Sequential Elections |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe, Lena Schend |
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Controlling Candidate-Sequential Elections |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
The Complexity of Online Manipulation of Sequential Elections |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Trung Thanh Nguyen 0004, Magnus Roos, Jörg Rothe |
A Survey of Approximability and Inapproximability Results for Social Welfare Optimization in Multiagent Resource Allocation. |
ISAIM |
2012 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe, Lena Schend |
Typical-Case Challenges to Complexity Shields That Are Supposed to Protect Elections Against Manipulation and Control: A Survey. |
ISAIM |
2012 |
DBLP BibTeX RDF |
|
| 1 | Nhan-Tam Nguyen, Magnus Roos, Jörg Rothe |
Exact Optimization of Social Welfare by the Nash Product is DP-Complete. |
ISAIM |
2012 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 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 | Jörg Rothe, Dorothea Baumeister, Claudia Lindner, Irene Rothe |
Einführung in Computational Social Choice: Individuelle Strategien und kollektive Entscheidungen beim Spielen, Wählen und Teilen. |
|
2011 |
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 | Anja Rey, Jörg Rothe |
Bribery in Path-Disruption Games. |
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 | Dorothea Baumeister, Magnus Roos, Jörg Rothe |
Computational complexity of two variants of the possible winner problem. |
AAMAS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Magnus Roos, Jörg Rothe, Björn Scheuermann |
How to Calibrate the Scores of Biased Reviewers by Quadratic Programming. |
AAAI |
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, Lena Piras, Jörg Rothe |
Control Complexity in Fallback Voting |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Frank Gurski, Irene Rothe, Jörg Rothe, Egon Wanke |
Exakte Algorithmen für schwere Graphenprobleme. |
|
2010 |
DOI RDF |
|
| 1 | Anja Rey, Jörg Rothe |
Merging and Splitting for Power Indices in Weighted Voting Games and Network Flow Games on Hypergraphs. |
STAIRS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Anja Rey, Jörg Rothe |
Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games. |
ECAI |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. |
ECAI |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Roos, Jörg Rothe |
Complexity of social welfare optimization in multiagent resource allocation. |
AAMAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe |
The Complexity of Computing Minimal Unidirectional Covering Sets. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. |
Math. Log. Q. |
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. |
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 | Dorothea Baumeister, Jörg Rothe |
The three-color and two-color TantrixTM rotation puzzle problems are NP-complete via parsimonious reductions. |
Inf. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. |
Fundam. Inform. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jörg Rothe |
Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein |
The Cost of Stability in Coalitional Games |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Claudia Lindner, Jörg Rothe |
Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols |
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 |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Llull and Copeland Voting Computationally Resist Bribery and Constructive Control. |
J. Artif. Intell. Res. (JAIR) |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Claudia Lindner, Jörg Rothe |
Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. |
WINE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Bachrach, Edith Elkind, Reshef Meir, Dmitrii V. Pasechnik, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein |
The Cost of Stability in Coalitional Games. |
SAGT |
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. |
ADT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Bachrach, Reshef Meir, Michael Zuckerman, Jörg Rothe, Jeffrey S. Rosenschein |
The cost of stability in weighted voting games. |
AAMAS |
2009 |
DBLP DOI BibTeX RDF |
core, coalition formation, weighted voting games |
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
The shield that never was: societies with single-peaked preferences are more open to manipulation and control. |
TARK |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena |
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Llull and Copeland Voting Computationally Resist Bribery and Control |
CoRR |
2008 |
DBLP 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 | Jörg Rothe |
Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität. |
|
2008 |
DOI RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Copeland Voting Fully Resists Constructive Control. |
AAIM |
2008 |
DBLP DOI BibTeX RDF |
Computational social choice theory, multiagent systems, preference aggregation |
| 1 | Dorothea Baumeister, Jörg Rothe |
The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. |
LATA |
2008 |
DBLP DOI 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 | Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto |
An improved exact algorithm for the domatic number problem. |
Inf. Process. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Copeland Voting Fully Resists Constructive Control |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 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 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Anyone but him: The complexity of precluding an alternative. |
Artif. Intell. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Rothe |
Review of "Complexity and Cryptography: An Introduction by John Talbot and Dominic Welsh", Cambridge University Press, 2006, 292 pages. |
SIGACT News |
2007 |
DBLP DOI 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 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. |
MCU |
2007 |
DBLP DOI BibTeX RDF |
rotation puzzle, tiling of the plane, parsimonious reduction, computational complexity, counting problem |
| 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 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Llull and Copeland Voting Broadly Resist Bribery and Control. |
AAAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | André Große, Jörg Rothe, Gerd Wechsung |
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. |
Inf. Process. Lett. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe |
If P neq NP then some strongly noninvertible functions are invertible. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. |
ITA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Rothe, Hiroki Arimura |
Computational Challenges of Massive Data Sets and Randomness in Computation (J.UCS Special Issue on the First and Second Japanese-German Frontiers of Science Symposia). |
J. UCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey. |
J. UCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. |
J. UCS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto |
An Improved Exact Algorithm for the Domatic Number Problem |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
A Richer Understanding of the Complexity of Election Systems |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem. |
Theory Comput. Syst. |
2006 |
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 |
|
| 1 | Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena |
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Anyone but Him: The Complexity of Precluding an Alternative |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
An Exact 2.9416n Algorithm for the Three Domatic Number Problem |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. |
|
2005 |
DOI RDF |
|
| 1 | Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena |
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
An Exact 2.9416n Algorithm for the Three Domatic Number Problem. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
domatic number problem, Exact algorithms |
| 1 | Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe |
Anyone but Him: The Complexity of Precluding an Alternative. |
AAAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy. |
Algebraic Methods in Computational Complexity |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Exact complexity of Exact-Four-Colorability. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Rothe, Holger Spakowski, Jörg Vogel |
Exact Complexity of the Winner Problem for Young Elections. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Rothe, Lane A. Hemaspaandra |
On characterizing the existence of partial one-way permutations. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Riege, Jörg Rothe |
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Kryptographische Protokolle und Null-Information. |
Informatik Spektrum |
2002 |
DBLP DOI BibTeX RDF |
Public-Key-Kryptosysteme, Protokolle für Schlüsseltausch und digitale Signaturen, Einwegfunktionen, Zero-Knowledge-Protokolle, interaktive Beweissysteme |
| 1 | Tobias Riege, Jörg Rothe |
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | André Große, Jörg Rothe, Gerd Wechsung |
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. |
Theory Comput. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jörg Rothe |
Some facets of complexity theory and cryptography: A five-lecture tutorial. |
ACM Comput. Surv. |
2002 |
DBLP DOI BibTeX RDF |
public-key cryptography, Complexity theory, one-way functions, interactive proof systems, zero-knowledge protocols |
| 1 | Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. |
WG |
2002 |
DBLP DOI BibTeX RDF |
minimum vertex cover heuristics, parallel access to NP, Computational complexity, approximation, completeness |
| 1 | Jörg Rothe, Holger Spakowski, Jörg Vogel |
Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe, Holger Spakowski, Jörg Vogel |
Exact Complexity of the Winner Problem for Young Elections |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Edith Hemaspaandra, Jörg Rothe, Holger Spakowski |
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | André Große, Jörg Rothe, Gerd Wechsung |
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Exact Complexity of Exact-Four-Colorability |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | André Große, Jörg Rothe, Gerd Wechsung |
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs |
CoRR |
2001 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial |
CoRR |
2001 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")