Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"Princeton University" +contributor:("Braverman, Mark"). Showing records 1 – 5 of 5 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Princeton University

1. Garg, Ankit. Information Theoretic Relaxations in Complexity Theory .

Degree: PhD, 2016, Princeton University

 Since Shannon’s “A Mathematical Theory of Communication”, information theory has found applicability in a wide range of scientific disciplines. Over the past two decades, information… (more)

Subjects/Keywords: Communication Complexity; Complexity Theory; Information Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Garg, A. (2016). Information Theoretic Relaxations in Complexity Theory . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p

Chicago Manual of Style (16th Edition):

Garg, Ankit. “Information Theoretic Relaxations in Complexity Theory .” 2016. Doctoral Dissertation, Princeton University. Accessed October 14, 2019. http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p.

MLA Handbook (7th Edition):

Garg, Ankit. “Information Theoretic Relaxations in Complexity Theory .” 2016. Web. 14 Oct 2019.

Vancouver:

Garg A. Information Theoretic Relaxations in Complexity Theory . [Internet] [Doctoral dissertation]. Princeton University; 2016. [cited 2019 Oct 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p.

Council of Science Editors:

Garg A. Information Theoretic Relaxations in Complexity Theory . [Doctoral Dissertation]. Princeton University; 2016. Available from: http://arks.princeton.edu/ark:/88435/dsp01ks65hf69p


Princeton University

2. Mao, Jieming. Algorithms in Strategic or Noisy Environments .

Degree: PhD, 2018, Princeton University

 Algorithms are often used to interact with agents. When the input is collected from agents instead of being directly given, designing algorithms becomes more challenging.… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mao, J. (2018). Algorithms in Strategic or Noisy Environments . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01s7526g175

Chicago Manual of Style (16th Edition):

Mao, Jieming. “Algorithms in Strategic or Noisy Environments .” 2018. Doctoral Dissertation, Princeton University. Accessed October 14, 2019. http://arks.princeton.edu/ark:/88435/dsp01s7526g175.

MLA Handbook (7th Edition):

Mao, Jieming. “Algorithms in Strategic or Noisy Environments .” 2018. Web. 14 Oct 2019.

Vancouver:

Mao J. Algorithms in Strategic or Noisy Environments . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Oct 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp01s7526g175.

Council of Science Editors:

Mao J. Algorithms in Strategic or Noisy Environments . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01s7526g175


Princeton University

3. Schneider, Jonathan. Learning Algorithms in Strategic Environments .

Degree: PhD, 2018, Princeton University

 Learning algorithms are often analyzed under the assumption their inputs are drawn from stochastic or adversarial sources. Increasingly, these algorithms are being applied in strategic… (more)

Subjects/Keywords: algorithmic mechanism design; multi-armed bandits; online learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schneider, J. (2018). Learning Algorithms in Strategic Environments . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01w0892d703

Chicago Manual of Style (16th Edition):

Schneider, Jonathan. “Learning Algorithms in Strategic Environments .” 2018. Doctoral Dissertation, Princeton University. Accessed October 14, 2019. http://arks.princeton.edu/ark:/88435/dsp01w0892d703.

MLA Handbook (7th Edition):

Schneider, Jonathan. “Learning Algorithms in Strategic Environments .” 2018. Web. 14 Oct 2019.

Vancouver:

Schneider J. Learning Algorithms in Strategic Environments . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Oct 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp01w0892d703.

Council of Science Editors:

Schneider J. Learning Algorithms in Strategic Environments . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp01w0892d703


Princeton University

4. Ko, Young Kun. Hardness Amplification in Two Prover Game and Communication Complexity .

Degree: PhD, 2018, Princeton University

 Whether repeating a task n-times in parallel amplifies the complexity measure in question by n-times is a key technical challenge in complexity theory. As a… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ko, Y. K. (2018). Hardness Amplification in Two Prover Game and Communication Complexity . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp015138jh64d

Chicago Manual of Style (16th Edition):

Ko, Young Kun. “Hardness Amplification in Two Prover Game and Communication Complexity .” 2018. Doctoral Dissertation, Princeton University. Accessed October 14, 2019. http://arks.princeton.edu/ark:/88435/dsp015138jh64d.

MLA Handbook (7th Edition):

Ko, Young Kun. “Hardness Amplification in Two Prover Game and Communication Complexity .” 2018. Web. 14 Oct 2019.

Vancouver:

Ko YK. Hardness Amplification in Two Prover Game and Communication Complexity . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2019 Oct 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp015138jh64d.

Council of Science Editors:

Ko YK. Hardness Amplification in Two Prover Game and Communication Complexity . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp015138jh64d

5. Weinstein, Omri. Interactive Information Complexity and Applications .

Degree: PhD, 2015, Princeton University

 With applications in nearly every field of computer science, Communication Complexity constitutes one of the most useful methods for proving unconditional lower bounds - the… (more)

Subjects/Keywords: Circuit Complexity; Communication Complexity; Information Theory

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Weinstein, O. (2015). Interactive Information Complexity and Applications . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01p2676x79d

Chicago Manual of Style (16th Edition):

Weinstein, Omri. “Interactive Information Complexity and Applications .” 2015. Doctoral Dissertation, Princeton University. Accessed October 14, 2019. http://arks.princeton.edu/ark:/88435/dsp01p2676x79d.

MLA Handbook (7th Edition):

Weinstein, Omri. “Interactive Information Complexity and Applications .” 2015. Web. 14 Oct 2019.

Vancouver:

Weinstein O. Interactive Information Complexity and Applications . [Internet] [Doctoral dissertation]. Princeton University; 2015. [cited 2019 Oct 14]. Available from: http://arks.princeton.edu/ark:/88435/dsp01p2676x79d.

Council of Science Editors:

Weinstein O. Interactive Information Complexity and Applications . [Doctoral Dissertation]. Princeton University; 2015. Available from: http://arks.princeton.edu/ark:/88435/dsp01p2676x79d

.