Michael E. Saks

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Srikanth Srinivasan 0001

> Home > Persons > Michael E. Saks

Publications

2016
[j79]
- view
  authority control:
- export record
  dblp key:
  - journals/combinatorica/GilmerSS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/GilmerSS16
Justin Gilmer, Michael E. Saks, Srikanth Srinivasan:
Composition limits and separating examples for some boolean function complexity measures. Comb. 36(3): 265-311 (2016)
2015
[j75]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/GavinskyLSS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GavinskyLSS15
Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
A tail bound for read-k families of functions. Random Struct. Algorithms 47(1): 99-108 (2015)
2013
[c65]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/GilmerSS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/GilmerSS13
Justin Gilmer, Michael E. Saks, Srikanth Srinivasan:
Composition Limits and Separating Examples for Some Boolean Function Complexity Measures. CCC 2013: 185-196
[i17]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/GilmerSS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/GilmerSS13
Justin Gilmer, Michael E. Saks, Srikanth Srinivasan:
Composition limits and separating examples for some Boolean function complexity measures. CoRR abs/1306.0630 (2013)
2012
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1205-1478
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1205-1478
Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
A Tail Bound for Read-k Families of Functions. CoRR abs/1205.1478 (2012)
[i10]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GavinskyLSS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GavinskyLSS12
Dmitry Gavinsky, Shachar Lovett, Michael E. Saks, Srikanth Srinivasan:
A Tail Bound for Read-k Families of Functions. Electron. Colloquium Comput. Complex. TR12 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.