The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michael E. Saks: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Allan Borodin, Nathan Linial, Michael E. Saks
    An Optimal Online Algorithm for Metrical Task Systems [Citation Graph (1, 0)][DBLP]
    STOC, 1987, pp:373-382 [Conf]
  2. Michael L. Fredman, Michael E. Saks
    The Cell Probe Complexity of Dynamic Data Structures [Citation Graph (1, 0)][DBLP]
    STOC, 1989, pp:345-354 [Conf]
  3. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
    Efficient construction of a small hitting set for combinatorial rectangles in high dimension. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:258-267 [Conf]
  4. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:237-251 [Conf]
  5. Eric Allender, Michael E. Saks, Igor Shparlinski
    A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:10-14 [Conf]
  6. Howard Barnum, Michael E. Saks, Mario Szegedy
    Quantum query complexity and semi-definite programming. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:179-193 [Conf]
  7. Navin Goyal, Michael E. Saks, Srinivasan Venkatesh
    Optimal Separation of EROW and CROWPRAMs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:93-0 [Conf]
  8. Jeff Kahn, Michael E. Saks, Clifford D. Smyth
    A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:98-103 [Conf]
  9. Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
    Non-deterministic Communication Complexity with Few Witness. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:275-281 [Conf]
  10. Michael E. Saks
    Randomization and Derandomization in Space_Bounded Computation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:128-149 [Conf]
  11. Ramamohan Paturi, Michael E. Saks
    On Threshold Circuits for Parity (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:390- [Conf]
  12. Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks
    On List Update and Work Function Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:289-300 [Conf]
  13. Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks
    Local Management of a Global Resource in a Communication Network [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:347-357 [Conf]
  14. Roy Armoni, Michael E. Saks, Avi Wigderson, Shiyu Zhou
    Discrepancy Sets and Pseudorandom Generators for Combinatorial Rectangles. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:412-421 [Conf]
  15. Baruch Awerbuch, Michael E. Saks
    A Dining Philosophers Algorithm with Polynomial Response Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:65-74 [Conf]
  16. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
    Super-linear time-space tradeoff lower bounds for randomized computation. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:169-179 [Conf]
  17. Paul Beame, Michael E. Saks, Jayram S. Thathachar
    Time-Space Tradeoffs for Branching Programs. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:254-263 [Conf]
  18. Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks
    A Decomposition Theorem and Bounds for Randomized Server Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:197-207 [Conf]
  19. Navin Goyal, Guy Kindler, Michael E. Saks
    Lower Bounds for the Noisy Broadcast Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:40-52 [Conf]
  20. Jeff Kahn, Michael E. Saks, Dean Sturtevant
    A Topological Approach to Evasiveness [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:31-33 [Conf]
  21. Richard M. Karp, Michael E. Saks, Avi Wigderson
    On a Search Problem Related to Branch-and-Bound Procedures [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:19-28 [Conf]
  22. Nathan Linial, Michael E. Saks
    Information Bounds Are Good for Search Problems on Ordered Data Structures [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:473-475 [Conf]
  23. László Lovász, Michael E. Saks
    Lattices, Möbius Functions and Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:81-90 [Conf]
  24. Ryan O'Donnell, Michael E. Saks, Oded Schramm, Rocco A. Servedio
    Every decision tree has an in.uential variable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:31-39 [Conf]
  25. Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
    An Improved Exponential-Time Algorithm for k-SAT. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:628-637 [Conf]
  26. Ramamohan Paturi, Michael E. Saks
    On Threshold Circuits for Parity [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:397-404 [Conf]
  27. Noam Nisan, Steven Rudich, Michael E. Saks
    Products and Help Bits in Decision Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:318-329 [Conf]
  28. Michael E. Saks, Avi Wigderson
    Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:29-38 [Conf]
  29. Michael E. Saks, Shiyu Zhou
    RSPACE(S) \subseteq DSPACE(S3/2). [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:344-353 [Conf]
  30. Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks
    A Complexity Index for Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:220-226 [Conf]
  31. Nathan Linial, David Peleg, Yuri Rabinovich, Michael E. Saks
    Sphere Packing and Local Majorities in Graphs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:141-149 [Conf]
  32. Yehuda Afek, Michael E. Saks
    Detecting Global Termination Conditions in the Face of Uncertainty. [Citation Graph (0, 0)][DBLP]
    PODC, 1987, pp:109-124 [Conf]
  33. Martin Dowd, Yehoshua Perl, Michael E. Saks
    The Balanced Sorting Network. [Citation Graph (0, 0)][DBLP]
    PODC, 1983, pp:161-172 [Conf]
  34. Michael E. Saks, Fotios Zaharoglou
    Optimal Space Distributed Move-to-Front Lists. [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:65-73 [Conf]
  35. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
    Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:11-15 [Conf]
  36. Michael E. Saks, Shiyu Zhou
    Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:95-109 [Conf]
  37. Michael E. Saks, Lan Yu
    Weak monotonicity suffices for truthfulness on convex domains. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2005, pp:286-293 [Conf]
  38. Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
    Randomized Robot Navigation Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:75-84 [Conf]
  39. Navin Goyal, Michael E. Saks
    Rounds vs queries trade-off in noisy computation. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:632-639 [Conf]
  40. Nathan Linial, Michael E. Saks
    Decomposing Graphs into Regions of Small Diameter. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:320-330 [Conf]
  41. Michael E. Saks, Nir Shavit, Heather Woll
    Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:351-362 [Conf]
  42. Zdenek Dvorak, Vít Jelínek, Daniel Král, Jan Kyncl, Michael E. Saks
    Three Optimal Algorithms for Balls of Three Colors. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:206-217 [Conf]
  43. Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin, Michael E. Saks
    A Lower Bound on the Competitive Ratio of Truthful Auctions. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:644-655 [Conf]
  44. Baruch Awerbuch, Boaz Patt-Shamir, David Peleg, Michael E. Saks
    Adapting to Asynchronous Dynamic Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:557-570 [Conf]
  45. Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
    On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:561-571 [Conf]
  46. Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
    Size-depth trade-offs for threshold circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:541-550 [Conf]
  47. Jeff Kahn, Michael E. Saks
    Every Poset Has a Good Comparison [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:299-301 [Conf]
  48. David Lichtenstein, Nathan Linial, Michael E. Saks
    Imperfect Random Sources and Discrete Controlled Processes [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:169-177 [Conf]
  49. Nathan Linial, Avner Magen, Michael E. Saks
    Trees and Euclidean Metrics. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:169-175 [Conf]
  50. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential Lower Bounds for Depth 3 Boolean Circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:86-91 [Conf]
  51. Alexander Russell, Michael E. Saks, David Zuckerman
    Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:339-347 [Conf]
  52. Michael E. Saks, Xiaodong Sun
    Space lower bounds for distance approximation in the data stream model. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:360-369 [Conf]
  53. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
    Explicit dispersers with polylog degree. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:479-488 [Conf]
  54. Michael E. Saks, Fotios Zaharoglou
    Wait-free k-set agreement is impossible: the topology of public knowledge. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:101-110 [Conf]
  55. Michael E. Saks, Shiyu Zhou
    Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:418-431 [Journal]
  56. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
  57. Ramamohan Paturi, Michael E. Saks, Francis Zane
    Exponential lower bounds for depth three Boolean circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:1, pp:1-15 [Journal]
  58. Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour
    The smallets n-uniform hypergraph with positive discrepancy. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1987, v:7, n:2, pp:151-160 [Journal]
  59. Fan R. K. Chung, Ronald L. Graham, Michael E. Saks
    A dynamic location problem for graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:2, pp:111-131 [Journal]
  60. Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
    Sharpening the LYM inequality. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:3, pp:287-293 [Journal]
  61. Jeff Kahn, Michael E. Saks
    A polyomino with no stochastic function. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:2, pp:181-182 [Journal]
  62. Jeff Kahn, Michael E. Saks, Dean Sturtevant
    A topological approach to evasiveness. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:297-306 [Journal]
  63. David Lichtenstein, Nathan Linial, Michael E. Saks
    Some extremal problems arising form discrete control processes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:3, pp:269-287 [Journal]
  64. Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman
    Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:215-234 [Journal]
  65. Nathan Linial, Michael E. Saks
    Low diameter graph decompositions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:441-454 [Journal]
  66. Nathan Linial, Michael E. Saks, Vera T. Sós
    Largest digraphs contained in all n-tournaments. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:101-104 [Journal]
  67. Michael E. Saks, Alex Samorodnitsky, Leonid Zosin
    A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:525-530 [Journal]
  68. Michael E. Saks, Michael Werman
    On computing majority by comparisons. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:4, pp:383-387 [Journal]
  69. Yosef Rinott, Michael E. Saks
    Correlation inequalities and a conjecture for permanents. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:3, pp:269-277 [Journal]
  70. Howard Barnum, Michael E. Saks
    A lower bound on the quantum query complexity of read-once functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  71. Nathan Linial, Michael E. Saks
    The Euclidean Distortion of Complete Binary Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:19-21 [Journal]
  72. Michael E. Saks
    Kleitman and combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:225-247 [Journal]
  73. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
    Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:25, pp:- [Journal]
  74. Howard Barnum, Michael E. Saks
    A lower bound on the quantum query complexity of read-once functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:002, pp:- [Journal]
  75. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC0 Circuits Given a Truth Table [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:126, pp:- [Journal]
  76. Eric Allender, Igor Shparlinski, Michael E. Saks
    A Lower Bound for Primality [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:10, pp:- [Journal]
  77. Ramamohan Paturi, Michael E. Saks
    Approximating Threshold Circuits by Rational Functions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:2, pp:257-272 [Journal]
  78. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou, David Zuckerman
    Low discrepancy sets yield approximate min-wise independent permutation families. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:1-2, pp:29-32 [Journal]
  79. Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, Michael E. Saks
    Local Management of a Global Resource in a Communication Network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:1, pp:1-19 [Journal]
  80. Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee
    Time-space trade-off lower bounds for randomized computation of decision problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:2, pp:154-195 [Journal]
  81. Allan Borodin, Nathan Linial, Michael E. Saks
    An Optimal On-Line Algorithm for Metrical Task System. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:745-763 [Journal]
  82. Martin Dowd, Yehoshua Perl, Larry Rudolph, Michael E. Saks
    The periodic balanced sorting network. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:4, pp:738-757 [Journal]
  83. Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
    An improved exponential-time algorithm for k-SAT. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:3, pp:337-364 [Journal]
  84. Michael E. Saks, Aravind Srinivasan, Shiyu Zhou
    Explicit OR-Dispersers with Polylogarithmic Degree. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:1, pp:123-154 [Journal]
  85. Nathan Linial, Michael E. Saks
    Searching Ordered Structures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:1, pp:86-103 [Journal]
  86. Michael E. Saks, Fotios Zaharoglou
    Optimal Space Distributed Order-Preserving Lists. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:31, n:2, pp:320-334 [Journal]
  87. Eric Allender, Michael E. Saks, Igor Shparlinski
    A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:356-366 [Journal]
  88. Howard Barnum, Michael E. Saks
    A lower bound on the quantum query complexity of read-once functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:69, n:2, pp:244-258 [Journal]
  89. Paul Beame, T. S. Jayram, Michael E. Saks
    Time-Space Tradeoffs for Branching Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:4, pp:542-572 [Journal]
  90. Mauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson
    Non-Deterministic Communication Complexity with Few Witnesses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1994, v:49, n:2, pp:247-257 [Journal]
  91. László Lovász, Michael E. Saks
    Communication Complexity and Combinatorial Lattice Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:2, pp:322-349 [Journal]
  92. Michael E. Saks, Shiyu Zhou
    BP HSpace(S) subseteq DSPACE(S3/2). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:2, pp:376-403 [Journal]
  93. Ernest Brickell, Michael E. Saks
    The Number of Distinct Subset Sums of a Finite Set of Vectors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:63, n:2, pp:234-256 [Journal]
  94. Paul Erdös, Michael E. Saks, Vera T. Sós
    Maximum induced trees in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:61-79 [Journal]
  95. Dan Gusfield, Robert W. Irving, Paul Leather, Michael E. Saks
    Every finite distributive lattice is a set of stable matchings for a small stable marriage instance. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1987, v:44, n:2, pp:304-309 [Journal]
  96. Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks
    Witness Sets for Families of Binary Vectors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:376-380 [Journal]
  97. László Lovász, Michael E. Saks
    A localization inequality for set functions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:4, pp:726-735 [Journal]
  98. Navin Goyal, Michael E. Saks
    A parallel search game. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:2, pp:227-234 [Journal]
  99. Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
    The Efficiency of Resolution and Davis--Putnam Procedures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1048-1075 [Journal]
  100. Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks
    A Decomposition Theorem for Task Systems and Bounds for Randomized Server Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1624-1661 [Journal]
  101. Endre Boros, Yves Crama, Peter L. Hammer, Michael E. Saks
    A Complexity Index for Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:45-49 [Journal]
  102. Russell Impagliazzo, Ramamohan Paturi, Michael E. Saks
    Size-Depth Tradeoffs for Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:693-707 [Journal]
  103. Noam Nisan, Steven Rudich, Michael E. Saks
    Products and Help Bits in Decision Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:3, pp:1035-1050 [Journal]
  104. Alexander Russell, Michael E. Saks, David Zuckerman
    Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1645-1662 [Journal]
  105. Michael E. Saks, Fotios Zaharoglou
    Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1449-1483 [Journal]
  106. Michael E. Saks
    A Robust Noncryptographic Protocol for Collective Coin Flipping. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:2, pp:240-244 [Journal]
  107. Eric J. Anderson, Kirsten Hildrum, Anna R. Karlin, April Rasala, Michael E. Saks
    On list update and work function algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:393-418 [Journal]
  108. Michael E. Saks
    Some sequences associated with combinatorial structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:135-166 [Journal]
  109. Jeff Kahn, Michael E. Saks
    On the widths of finite distributive lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:183-195 [Journal]
  110. László Lovász, Michael E. Saks, William T. Trotter
    An on-line graph coloring algorithm with sublinear performance ratio. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:319-325 [Journal]
  111. Mauricio Karchmer, Nathan Linial, Ilan Newman, Michael E. Saks, Avi Wigderson
    Combinatorial characterization of read-once formulae. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:275-282 [Journal]
  112. Robert Hochberg, Colin McDiarmid, Michael E. Saks
    On the bandwidth of triangulated triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:261-265 [Journal]

  113. Parallel monotonicity reconstruction. [Citation Graph (, )][DBLP]


  114. Online multicast with egalitarian cost sharing. [Citation Graph (, )][DBLP]


  115. The Non-Crossing Graph. [Citation Graph (, )][DBLP]


  116. Every decision tree has an influential variable [Citation Graph (, )][DBLP]


  117. Approximation algorithms for problems in scheduling with set-ups. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002