Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Elkind, Edith"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of fully proportional representation for single-crossing electorates
Piotr Skowron
,
Lan Yu
,
Piotr Faliszewski
,
Edith Elkind
Theoretical Computer Science
569
, 2015, pp. 43-57
On the hardness of finding subsets with equal average
Edith Elkind
,
James B. Orlin
Information Processing Letters
113
(13), 2013, pp. 477-480
Quantifying the discord: Order discrepancies in message sequence charts
Edith Elkind
,
Blaise Genest
,
Doron Peled
,
Paola Spoletini
International Journal of Foundations of Computer Science
21
(2), 2010, pp. 211-233
On commutativity based edge lean search
Dragan Bos̑nac̑ki
,
Edith Elkind
,
Blaise Genest
,
Doron Peled
Lecture Notes in Computer Science
4596
, 2007, pp. 158-170
Hybrid voting protocols and hardness of manipulation
Edith Elkind
,
Helger Lipmaa
Lecture Notes in Computer Science
3827
, 2005, pp. 206-215