en
de
Local
OpenID
:
no help available
no help available
BibSonomy
author
tag
user
group
author
concept
BibTeX key
search:all
::
Saks
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
actions for all displayed bookmarks:
export:
RSS
,
BibTeX
,
XML
sort:
criterion:
date
,
title
order:
ascending
,
descending
others:
bookmarks per page:
5
10
20
50
100
bookmarks
actions for all displayed publications:
export:
RSS
,
BibTeX
,
RDF
,
more...
sort:
criterion:
date
,
title
order:
ascending
,
descending
advanced...
others:
publications per page:
5
10
20
50
100
publications
(156)
tags
dblp
imported
Gov't,
Cell
Non-U.S.
Support,
Metabolism,
corruption
14977166
Compartmentation,
Research
Public
Energy
No matching items.
On the practically interesting instances of MAXCUT.
Yonatan Bilu
,
Amit Daniely
,
Nati Linial
, and
Michael Saks
.
STACS,
volume 20 of LIPIcs,
page 526-537.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
(
2013
)
Yonatan Bilu
,
Amit Daniely
,
Nati Linial
, and
Michael Saks
.
STACS,
volume 20 of LIPIcs,
page 526-537.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
(
2013
)
3 months and 23 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Lower Bound for Primality.
Eric Allender
,
Michael E. Saks
, and
Igor Shparlinski
.
IEEE Conference on Computational Complexity,
page 10-14.
IEEE Computer Society,
(
1999
)
Eric Allender
,
Michael E. Saks
, and
Igor Shparlinski
.
IEEE Conference on Computational Complexity,
page 10-14.
IEEE Computer Society,
(
1999
)
4 months and 28 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Non-deterministic Communication Complexity with Few Witness.
Mauricio Karchmer
,
Ilan Newman
,
Michael E. Saks
, and
Avi Wigderson
.
Structure in Complexity Theory Conference,
page 275-281.
IEEE Computer Society,
(
1992
)
Mauricio Karchmer
,
Ilan Newman
,
Michael E. Saks
, and
Avi Wigderson
.
Structure in Complexity Theory Conference,
page 275-281.
IEEE Computer Society,
(
1992
)
4 months and 28 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Dual Version of Reimer's Inequality and a Proof of Rudich's Conjecture.
Jeff Kahn
,
Michael E. Saks
, and
Clifford D. Smyth
.
IEEE Conference on Computational Complexity,
page 98-103.
IEEE Computer Society,
(
2000
)
Jeff Kahn
,
Michael E. Saks
, and
Clifford D. Smyth
.
IEEE Conference on Computational Complexity,
page 98-103.
IEEE Computer Society,
(
2000
)
4 months and 28 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Randomization and Derandomization in Space_Bounded Computation.
Michael E. Saks
.
IEEE Conference on Computational Complexity,
page 128-149.
IEEE Computer Society,
(
1996
)
Michael E. Saks
.
IEEE Conference on Computational Complexity,
page 128-149.
IEEE Computer Society,
(
1996
)
4 months and 28 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A Tail Bound for Read-k Families of Functions.
Dmitry Gavinsky
,
Shachar Lovett
,
Michael E. Saks
, and
Srikanth Srinivasan
.
Electronic Colloquium on Computational Complexity ECCC
(
2012
)
Dmitry Gavinsky
,
Shachar Lovett
,
Michael E. Saks
, and
Srikanth Srinivasan
.
Electronic Colloquium on Computational Complexity ECCC
(
2012
)
5 months and 6 days ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Minimizing DNF Formulas and AC0 Circuits Given a Truth Table
Eric Allender
,
Lisa Hellerstein
,
Paul McCabe
,
Toniann Pitassi
, and
Michael E. Saks
.
Electronic Colloquium on Computational Complexity ECCC
(
2005
)
Eric Allender
,
Lisa Hellerstein
,
Paul McCabe
,
Toniann Pitassi
, and
Michael E. Saks
.
Electronic Colloquium on Computational Complexity ECCC
(
2005
)
5 months and 6 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A New Technique Enables Dynamic Replanning and Rescheduling of Aeromedical Evacuation.
Alexander Kott
,
Victor Saks
, and
Albert Mercer
.
AAAI/IAAI,
page 1063-1070.
AAAI Press / The MIT Press,
(
1998
)
Alexander Kott
,
Victor Saks
, and
Albert Mercer
.
AAAI/IAAI,
page 1063-1070.
AAAI Press / The MIT Press,
(
1998
)
6 months and 7 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Rounds vs queries trade-off in noisy computation.
Navin Goyal
, and
Michael E. Saks
.
SODA,
page 632-639.
SIAM,
(
2005
)
Navin Goyal
, and
Michael E. Saks
.
SODA,
page 632-639.
SIAM,
(
2005
)
6 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Parallel monotonicity reconstruction.
Michael E. Saks
, and
C. Seshadhri
.
SODA,
page 962-971.
SIAM,
(
2008
)
Michael E. Saks
, and
C. Seshadhri
.
SODA,
page 962-971.
SIAM,
(
2008
)
6 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Decomposing Graphs into Regions of Small Diameter.
Nathan Linial
, and
Michael E. Saks
.
SODA,
page 320-330.
ACM/SIAM,
(
1991
)
Nathan Linial
, and
Michael E. Saks
.
SODA,
page 320-330.
ACM/SIAM,
(
1991
)
6 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Optimal Time Randomized Consensus - Making Resilient Algorithms Fast in Practice.
Michael E. Saks
,
Nir Shavit
, and
Heather Woll
.
SODA,
page 351-362.
ACM/SIAM,
(
1991
)
Michael E. Saks
,
Nir Shavit
, and
Heather Woll
.
SODA,
page 351-362.
ACM/SIAM,
(
1991
)
6 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Randomized Robot Navigation Algorithms.
Piotr Berman
,
Avrim Blum
,
Amos Fiat
,
Howard J. Karloff
,
Adi Rosén
, and
Michael E. Saks
.
SODA,
page 75-84.
ACM/SIAM,
(
1996
)
Piotr Berman
,
Avrim Blum
,
Amos Fiat
,
Howard J. Karloff
,
Adi Rosén
, and
Michael E. Saks
.
SODA,
page 75-84.
ACM/SIAM,
(
1996
)
6 months and 14 days ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On Online Labeling with Polynomially Many Labels
Martin Babka
,
Jan Bulánek
,
Vladimír Cunát
,
Michal Koucký
, and
Michael Saks
.
CoRR
(
2012
)
Martin Babka
,
Jan Bulánek
,
Vladimír Cunát
,
Michal Koucký
, and
Michael Saks
.
CoRR
(
2012
)
7 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
A Tail Bound for Read-k Families of Functions
Dmitry Gavinsky
,
Shachar Lovett
,
Michael Saks
, and
Srikanth Srinivasan
.
CoRR
(
2012
)
Dmitry Gavinsky
,
Shachar Lovett
,
Michael Saks
, and
Srikanth Srinivasan
.
CoRR
(
2012
)
8 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distance
Michael Saks
, and
C. Seshadhri
.
CoRR
(
2012
)
Michael Saks
, and
C. Seshadhri
.
CoRR
(
2012
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Tight lower bounds for online labeling problem
Jan Bulánek
,
Michal Koucký
, and
Michael Saks
.
CoRR
(
2011
)
Jan Bulánek
,
Michal Koucký
, and
Michael Saks
.
CoRR
(
2011
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Clustering is difficult only when it does not matter
Amit Daniely
,
Nati Linial
, and
Michael Saks
.
CoRR
(
2012
)
Amit Daniely
,
Nati Linial
, and
Michael Saks
.
CoRR
(
2012
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On the practically interesting instances of MAXCUT
Yonatan Bilu
,
Amit Daniely
,
Nati Linial
, and
Michael Saks
.
CoRR
(
2012
)
Yonatan Bilu
,
Amit Daniely
,
Nati Linial
, and
Michael Saks
.
CoRR
(
2012
)
8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On Online Labeling with Polynomially Many Labels.
Martin Babka
,
Jan Bulánek
,
Vladimír Cunát
,
Michal Koucký
, and
Michael Saks
.
ESA,
volume 7501 of Lecture Notes in Computer Science,
page 121-132.
Springer,
(
2012
)
Martin Babka
,
Jan Bulánek
,
Vladimír Cunát
,
Michal Koucký
, and
Michael Saks
.
ESA,
volume 7501 of Lecture Notes in Computer Science,
page 121-132.
Springer,
(
2012
)
9 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact