Michael E. Saks
Orcid: 0000-0003-1659-7190Affiliations:
- Rutgers University, Department of Mathematics
According to our database1,
Michael E. Saks
authored at least 155 papers
between 1979 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 39th Computational Complexity Conference, 2024
2023
Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Electron. Colloquium Comput. Complex., 2022
2020
Random Struct. Algorithms, 2020
J. ACM, 2020
An Asymptotically Tight Bound on the Number of Relevant Variables in a Bounded Degree Boolean function.
Comb., 2020
Constant factor approximations to edit distance on far input pairs in nearly linear time.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
Proceedings of the 35th Computational Complexity Conference, 2020
2019
2018
Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function.
CoRR, 2018
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
Proceedings of the Computer Science - Theory and Applications, 2018
2017
SIAM J. Comput., 2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
2016
J. Comput. Syst. Sci., 2016
Electron. Colloquium Comput. Complex., 2016
Composition limits and separating examples for some boolean function complexity measures.
Comb., 2016
2015
Random Struct. Algorithms, 2015
Electron. Colloquium Comput. Complex., 2015
Comput. Complex., 2015
A polylogarithmic space deterministic streaming algorithm for approximating distance to monotonicity.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015
2014
Electron. Colloquium Comput. Complex., 2014
2013
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the Algorithms - ESA 2012, 2012
2011
Algorithmica, 2011
2010
Comput. Complex., 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Minimizing Disjunctive Normal Form Formulas and AC<sup>0</sup> Circuits Given a Truth Table.
SIAM J. Comput., 2008
Discret. Appl. Math., 2008
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
2007
Random Struct. Algorithms, 2007
2006
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006
2005
Electron. Colloquium Comput. Complex., 2005
Proceedings of the STACS 2005, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
J. Comput. Syst. Sci., 2004
Comb., 2004
Proceedings of the STACS 2004, 2004
2003
J. ACM, 2003
Comput. Complex., 2003
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003
2002
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model.
SIAM J. Comput., 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
2001
Sample Spaces with Small Bias on Neighborhoods and Error-Correcting Communication Protocols.
Algorithmica, 2001
2000
SIAM J. Comput., 2000
SIAM J. Comput., 2000
Inf. Process. Lett., 2000
Electron. Colloquium Comput. Complex., 2000
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000
1999
J. Comput. Syst. Sci., 1999
1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
1997
Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension.
Comb., 1997
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997
1996
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996
1995
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
1994
J. Comput. Syst. Sci., 1994
1993
The Number of Distinct Subset Sums of a Finite Set of Vectors.
J. Comb. Theory A, 1993
J. Comput. Syst. Sci., 1993
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993
1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992
1991
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991
1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990
1989
SIAM J. Discret. Math., 1989
Discret. Math., 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number.
J. Graph Theory, 1987
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance.
J. Comb. Theory A, 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987
1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
1984
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984
1983
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1980
SIAM J. Algebraic Discret. Methods, 1980
1979