#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2009

2017

- This year (0)
- Last 5 years (13)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Joshua F. Apgar, David Witmer, Forest M. White, Bruce Tidor
- Molecular bioSystems
- 2010

Computational models are increasingly used to understand and predict complex biological phenomena. These models contain many unknown parameters, at least some of which are difficult to measureâ€¦ (More)

- Sarah R. Allen, Ryan M O'Donnell, David Witmer
- 2015 IEEE 56th Annual Symposium on Foundations ofâ€¦
- 2015

Let P be a k-ary predicate over a finite alphabet. Consider a random CSP(P) instance I over n variables with m constraints. When m â‰« n the instance will be unsatisfiable with high probability and weâ€¦ (More)

- Ryan M O'Donnell, David Witmer
- 2014 IEEE 29th Conference on Computationalâ€¦
- 2014

Furthering the study of cryptography in constant parallel time, we give new evidence for the security of Gold Reich's candidate pseudorandom generator with near-optimal, polynomial stretch. Ourâ€¦ (More)

- Anupam Gupta, Kunal Talwar, David Witmer
- STOC
- 2013

We give a 2-approximation algorithm for the non-uniform Sparsest Cut problem that runs in time nO(k), where k is the treewidth of the graph. This improves on the previous 22k-approximation in timeâ€¦ (More)

- Keith R. Shockley, David Witmer, Sarah L Burgess-Herbert, Beverly J. Paigen, Gary A. Churchill
- Physiological genomics
- 2009

Diets high in fat and cholesterol are associated with increased obesity and metabolic disease in mice and humans. To study the molecular basis of the metabolic response to dietary fat, 10 inbredâ€¦ (More)

- Pravesh Kothari, Ryuhei Mori, Ryan M O'Donnell, David Witmer
- STOC
- 2017

Let <i>P</i>:{0,1}<sup><i>k</i></sup> Ã¢Â†Â’ {0,1} be a nontrivial <i>k</i>-ary predicate. Consider a random instance of the constraint satisfaction problem (<i>P</i>) on <i>n</i> variables with ÃŽÂ”â€¦ (More)

- Boaz Barak, Ankur Moitra, +7 authors John Wright
- APPROX-RANDOM
- 2015

We show that for any odd k and any instance = of the Max-kXOR constraint satisfaction problem, there is an efficient algorithm that finds an assignment satisfying at least a 1 2 +Î©(1/ âˆš D) fractionâ€¦ (More)

- Sarah M. Loos, David Witmer, Peter Steenkiste, AndrÃ© Platzer
- 16th International IEEE Conference on Intelligentâ€¦
- 2013

We consider an adaptive cruise control system in which control decisions are made based on position and velocity information received from other vehicles via V2V wireless communication. If theâ€¦ (More)

Let P be a nontrivial k-ary predicate over a finite alphabet. Consider a random CSP(P ) instance I over n variables with m constraints, each being P applied to k random literals. When m â‰« n theâ€¦ (More)

- Ryan M O'Donnell, David Witmer
- ArXiv
- 2012

Consider an irreducible reversible Markov chain on state space V , with |V | = n and invariant distribution Ï€. Let 0 = Î»1 â‰¤ Î»2 â‰¤ Â· Â· Â·Î»n â‰¤ 2 be the eigenvalues of its Laplacian operator. We give aâ€¦ (More)