Annamária Kovács

SIGecom Exch., 2023

A Proof of the Nisan-Ronen Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2021

Truthful Allocation in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

On the Nisan-Ronen conjecture.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

On the Nisan-Ronen conjecture for submodular valuations.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2017

EEG correlates of speech: Examination of event related potentials elicited by phoneme classes.

[BibT_eX]

[DOI]

István Winkler

Klára Vicsi

Proceedings of the 8th IEEE International Conference on Cognitive Infocommunications, 2017

2016

Tight Bounds for the Price of Anarchy of Simultaneous First-Price Auctions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2016

2015

The optimal structure of algorithms for α-paging.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Mechanisms with Monitoring for Truthful RAM Allocation.

[BibT_eX]

[DOI]

Ulrich Meyer

Carmine Ventre

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

A Characterization of n-Player Strongly Monotone Scheduling Mechanisms.

[BibT_eX]

[DOI]

Angelina Vidali

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Comparison of skewness-based salient event detector algorithms in speech.

[BibT_eX]

[DOI]

Proceedings of the 6th IEEE International Conference on Cognitive Infocommunications, 2015

2011

A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

2010

New Approximation Bounds for Lpt Scheduling.

[BibT_eX]

[DOI]

Algorithmica, 2010

A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines.

[BibT_eX]

[DOI]

Rob van Stee

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

A Deterministic Truthful PTAS for Scheduling Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Online paging for flash memory devices.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Bayesian Combinatorial Auctions.

[BibT_eX]

[DOI]

Michael Schapira

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Mechanism Design for Fractional Scheduling on Unrelated Machines.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Fast algorithms for two scheduling problems.

[BibT_eX]

[DOI]

PhD thesis, 2006

Tighter Approximation Bounds for LPT Scheduling in Two Special Cases.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Polynomial Time Preemptive Sum-Multicoloring on Paths.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

2004

Sum-Multicoloring on Paths.

[BibT_eX]

[DOI]