Author of the publication

Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems.

, , , , and . IEEE Trans. Computers, 52 (9): 1210-1214 (2003)

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.

 

Other publications of authors with the same name

Analysis of multi-stage open shop processing systems., , and . STACS, volume 9 of LIPIcs, page 484-494. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)An axiomatic characterization of the Hirsch-index.. Math. Soc. Sci., 56 (2): 224-232 (2008)A note on scoring rules that respect majority in choice and elimination.. Math. Soc. Sci., 46 (3): 347-354 (2003)A hardness result for core stability in additive hedonic games.. Math. Soc. Sci., 65 (2): 101-104 (2013)Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 160-169. Springer, (2002)How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?, , , , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 82-93. Springer, (2008)Getting the Best Response for Your Erg., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 14-25. Springer, (2004)Nothing New about Equiangular Polygons.. The American Mathematical Monthly, 120 (9): 849-850 (2013)Competitive Odds and Ends., and . Online Algorithms, volume 1442 of Lecture Notes in Computer Science, page 385-394. Springer, (1996)More about Subcolorings., , , and . WG, volume 2573 of Lecture Notes in Computer Science, page 68-79. Springer, (2002)