The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Egor Ianovski" ( http://dblp.L3S.de/Authors/Egor_Ianovski )

  Author page on DBLP  Author page in RDF  Community of Egor Ianovski in ASPL-2

Publication years (Num. hits)
2011-2018 (16) 2019 (3)
Publication types (Num. hits)
article(15) inproceedings(3) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 20 publication records. Showing 19 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Egor Ianovski, Mark C. Wilson Manipulability of consular election rules. Search on Bibsonomy Social Choice and Welfare The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Egor Ianovski Electing a committee with constraints. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Aleksei Y. Kondratev, Egor Ianovski, Alexander S. Nesterov How should we score athletes and candidates: geometric scoring rules. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Egor Ianovski, Luke Ong The complexity of decision problems about equilibria in two-player Boolean games. Search on Bibsonomy Artif. Intell. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Egor Ianovski, Luke Ong Simulating cardinal preferences in Boolean games: A proof technique. Search on Bibsonomy Inf. Comput. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Egor Ianovski Complexity of mixed equilibria in Boolean games. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Egor Ianovski, Mark C. Wilson Manipulability of consular election rules. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Egor Ianovski Two statements of the Duggan-Schwartz theorem. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Egor Ianovski Complexity of mixed equilibria in Boolean games. Search on Bibsonomy 2016   RDF
1Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies Complexity of Equivalence Relations and Preorders from Computability Theory. Search on Bibsonomy J. Symb. Log. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Egor Ianovski DValue for Boolean games is EXP-complete. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Egor Ianovski The existential fragment of S1S over element and successor is the co-Buchi languages. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Egor Ianovski, Luke Ong EGuaranteeNash for Boolean Games Is NEXP-Hard. Search on Bibsonomy KR The full citation details ... 2014 DBLP  BibTeX  RDF
1Egor Ianovski Computable Component-wise Reducibility Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Egor Ianovski, Luke Ong EGuaranteeNash for Boolean Games is NEXP-Hard. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
1Alwen Tiu, Egor Ianovski, Rajeev Goré Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Egor Ianovski Cake Cutting Mechanisms Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Alwen Tiu, Egor Ianovski, Rajeev Goré Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures. Search on Bibsonomy Advances in Modal Logic The full citation details ... 2012 DBLP  BibTeX  RDF
1Egor Ianovski, Lan Yu, Edith Elkind, Mark C. Wilson The Complexity of Safe Manipulation under Scoring Rules. Search on Bibsonomy IJCAI The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #19 of 19 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license