( en | de | ru )

 

Disambiguation of "Kovács, Annamária"

Author of the publication

copydeleteadd this publication to your clipboard
Online paging for flash memory devices.

, , , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 352-361. Springer, (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Annamária Kovács

Annamária Dersi

Annamária Simon

János Kovács

Ern Kovács

 

Other publications of authors with the same name

A Global Characterization of Envy-Free Truthful Scheduling of Two Tasks., and . WINE, volume 7090 of Lecture Notes in Computer Science, page 84-96. Springer, (2011)A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines., , and . WINE, volume 6484 of Lecture Notes in Computer Science, page 182-193. Springer, (2010)Fast Monotone 3-Approximation Algorithm for Scheduling Related Machines.. ESA, volume 3669 of Lecture Notes in Computer Science, page 616-627. Springer, (2005)On the Nisan-Ronen conjecture., , and . FOCS, page 839-850. IEEE, (2021)EEG correlates of speech: Examination of event related potentials elicited by phoneme classes., , and . CogInfoCom, page 115-120. IEEE, (2017)On the Nisan-Ronen conjecture for submodular valuations., , and . STOC, page 1086-1096. ACM, (2020)Fast algorithms for two scheduling problems.. Saarland University, Germany, (2006)A Proof of the Nisan-Ronen Conjecture., , and . STOC, page 672-685. ACM, (2023)Mechanism Design for Fractional Scheduling on Unrelated Machines., , and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 40-52. Springer, (2007)Polynomial Time Preemptive Sum-Multicoloring on Paths.. ICALP, volume 3580 of Lecture Notes in Computer Science, page 840-852. Springer, (2005)