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:"University of Texas – Austin" +contributor:("Zuckerman, David"). Showing records 1 – 18 of 18 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Texas – Austin

1. Chen, Xue, Ph. D. Using and saving randomness.

Degree: Computer Sciences, 2018, University of Texas – Austin

 Randomness is ubiquitous and exceedingly useful in computer science. For example, in sparse recovery, randomized algorithms are more efficient and robust than their deterministic counterparts.… (more)

Subjects/Keywords: Query complexity; Linear families; Spectral sparsification; Active regression; Sparse Fourier transform; Hash families; Randomness extractor; Chaining argument; Multiple-choice schemes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Xue, P. D. (2018). Using and saving randomness. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/65850

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Xue, Ph D. “Using and saving randomness.” 2018. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/65850.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Xue, Ph D. “Using and saving randomness.” 2018. Web. 26 Jun 2019.

Vancouver:

Chen, Xue PD. Using and saving randomness. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/65850.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen, Xue PD. Using and saving randomness. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/65850

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

2. -9140-3160. Explicit two-source extractors and more.

Degree: Computer Sciences, 2016, University of Texas – Austin

 In this thesis we study the problem of extracting almost truly random bits from imperfect sources of randomness. This is motivated by the wide use… (more)

Subjects/Keywords: Extractor; Pseudorandomness; Cryptography; Explicit constructions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-9140-3160. (2016). Explicit two-source extractors and more. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/41451

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-9140-3160. “Explicit two-source extractors and more.” 2016. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/41451.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-9140-3160. “Explicit two-source extractors and more.” 2016. Web. 26 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-9140-3160. Explicit two-source extractors and more. [Internet] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/41451.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-9140-3160. Explicit two-source extractors and more. [Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/41451

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

3. Li, Xin, Ph. D. Distributed computing and cryptography with general weak random sources.

Degree: Computer Sciences, 2011, University of Texas – Austin

 The use of randomness in computer science is ubiquitous. Randomized protocols have turned out to be much more efficient than their deterministic counterparts. In addition,… (more)

Subjects/Keywords: Randomness; Weak random source; Extractor; Distributed computing; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Xin, P. D. (2011). Distributed computing and cryptography with general weak random sources. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/30361

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Li, Xin, Ph D. “Distributed computing and cryptography with general weak random sources.” 2011. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/30361.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Li, Xin, Ph D. “Distributed computing and cryptography with general weak random sources.” 2011. Web. 26 Jun 2019.

Vancouver:

Li, Xin PD. Distributed computing and cryptography with general weak random sources. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/30361.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li, Xin PD. Distributed computing and cryptography with general weak random sources. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/30361

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

4. -9790-6500. New coding techniques for distributed storage systems: enabling locality, availability and security.

Degree: Electrical and Computer Engineering, 2015, University of Texas – Austin

 Distributed storage systems (a.k.a. cloud storage networks) are becoming increasingly important, given the need to put away vast amounts of data that are being generated,… (more)

Subjects/Keywords: Coding for distributed storage; Locally repairable codes; Regenerating codes; Code repair; Cooperative repair; Secure distributed storage

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-9790-6500. (2015). New coding techniques for distributed storage systems: enabling locality, availability and security. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/32413

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-9790-6500. “New coding techniques for distributed storage systems: enabling locality, availability and security.” 2015. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/32413.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-9790-6500. “New coding techniques for distributed storage systems: enabling locality, availability and security.” 2015. Web. 26 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-9790-6500. New coding techniques for distributed storage systems: enabling locality, availability and security. [Internet] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/32413.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-9790-6500. New coding techniques for distributed storage systems: enabling locality, availability and security. [Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/32413

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

5. Bhowmick, Abhishek. Algebraic and analytic techniques in coding theory.

Degree: Computer Sciences, 2015, University of Texas – Austin

 Error correcting codes are designed to tackle the problem of reliable trans- mission of data through noisy channels. A major challenge in coding theory is… (more)

Subjects/Keywords: Polynomials; Coding theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhowmick, A. (2015). Algebraic and analytic techniques in coding theory. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/33308

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bhowmick, Abhishek. “Algebraic and analytic techniques in coding theory.” 2015. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/33308.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bhowmick, Abhishek. “Algebraic and analytic techniques in coding theory.” 2015. Web. 26 Jun 2019.

Vancouver:

Bhowmick A. Algebraic and analytic techniques in coding theory. [Internet] [Thesis]. University of Texas – Austin; 2015. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/33308.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bhowmick A. Algebraic and analytic techniques in coding theory. [Thesis]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/33308

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

6. -6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.

Degree: Computer Sciences, 2018, University of Texas – Austin

 In this thesis we study the problem of computing Betweenness Centrality in dynamic and distributed networks. Betweenness Centrality (BC) is a well-known measure for the… (more)

Subjects/Keywords: Betweenness centrality; Dynamic algorithms; Distributed algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-6879-6322. (2018). Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/63353

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-6879-6322. “Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.” 2018. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/63353.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-6879-6322. “Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems.” 2018. Web. 26 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/63353.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-6879-6322. Algorithms for dynamic and distributed networks : shortest paths, betweenness centrality and related problems. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/63353

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

7. -8689-6770. Strong lower bounds on generic convex relaxations.

Degree: Computer Sciences, 2016, University of Texas – Austin

 Despite significant successes in understanding the hardness of computational problems based on standard assumptions such as P != NP, there are important settings where the… (more)

Subjects/Keywords: Lower bounds; Semidefinite programming; Planted clique; Constraint satisfaction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-8689-6770. (2016). Strong lower bounds on generic convex relaxations. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/44040

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-8689-6770. “Strong lower bounds on generic convex relaxations.” 2016. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/44040.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-8689-6770. “Strong lower bounds on generic convex relaxations.” 2016. Web. 26 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-8689-6770. Strong lower bounds on generic convex relaxations. [Internet] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/44040.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-8689-6770. Strong lower bounds on generic convex relaxations. [Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/44040

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

8. -7845-7631. Graph theoretic results on index coding, causal inference and learning graphical models.

Degree: Electrical and Computer Engineering, 2016, University of Texas – Austin

 Exploiting and learning graph structures is becoming ubiquitous in Network Information Theory and Machine Learning. The former deals with efficient communication schemes in a many-node… (more)

Subjects/Keywords: Index coding; Causal inference; Information theory; Graphical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-7845-7631. (2016). Graph theoretic results on index coding, causal inference and learning graphical models. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/44041

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-7845-7631. “Graph theoretic results on index coding, causal inference and learning graphical models.” 2016. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/44041.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-7845-7631. “Graph theoretic results on index coding, causal inference and learning graphical models.” 2016. Web. 26 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-7845-7631. Graph theoretic results on index coding, causal inference and learning graphical models. [Internet] [Thesis]. University of Texas – Austin; 2016. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/44041.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-7845-7631. Graph theoretic results on index coding, causal inference and learning graphical models. [Thesis]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/44041

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

9. -4429-2872. Program obfuscation: new applications and constructions from standard assumptions.

Degree: Computer Sciences, 2018, University of Texas – Austin

 Code obfuscation has been one of the main focal points of cryptographic research over the last few years. This proposed thesis studies two different aspects… (more)

Subjects/Keywords: Code obfuscation; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

-4429-2872. (2018). Program obfuscation: new applications and constructions from standard assumptions. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/69248

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

-4429-2872. “Program obfuscation: new applications and constructions from standard assumptions.” 2018. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/69248.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

-4429-2872. “Program obfuscation: new applications and constructions from standard assumptions.” 2018. Web. 26 Jun 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-4429-2872. Program obfuscation: new applications and constructions from standard assumptions. [Internet] [Thesis]. University of Texas – Austin; 2018. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/69248.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

-4429-2872. Program obfuscation: new applications and constructions from standard assumptions. [Thesis]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/69248

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

10. Kamp, Jesse John. Deterministic extractors.

Degree: Computer Sciences, 2007, University of Texas – Austin

Subjects/Keywords: Random variables; Cryptography; Entropy (Information theory); Stochastic processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamp, J. J. (2007). Deterministic extractors. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kamp, Jesse John. “Deterministic extractors.” 2007. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/3112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kamp, Jesse John. “Deterministic extractors.” 2007. Web. 26 Jun 2019.

Vancouver:

Kamp JJ. Deterministic extractors. [Internet] [Thesis]. University of Texas – Austin; 2007. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/3112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kamp JJ. Deterministic extractors. [Thesis]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

11. Rao, Anup, 1980-. Randomness extractors for independent sources and applications.

Degree: Computer Sciences, 2007, University of Texas – Austin

 The use of randomized algorithms and protocols is ubiquitous in computer science. Randomized solutions are typically faster and simpler than deterministic ones for the same… (more)

Subjects/Keywords: Computer algorithms; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rao, Anup, 1. (2007). Randomness extractors for independent sources and applications. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3152

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rao, Anup, 1980-. “Randomness extractors for independent sources and applications.” 2007. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/3152.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rao, Anup, 1980-. “Randomness extractors for independent sources and applications.” 2007. Web. 26 Jun 2019.

Vancouver:

Rao, Anup 1. Randomness extractors for independent sources and applications. [Internet] [Thesis]. University of Texas – Austin; 2007. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/3152.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rao, Anup 1. Randomness extractors for independent sources and applications. [Thesis]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3152

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

12. Patthak, Anindya Chandra, 1977-. Error correcting codes: local testing, list decoding, and applications.

Degree: Computer Sciences, 2007, University of Texas – Austin

Subjects/Keywords: Error-correcting codes (Information theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Patthak, Anindya Chandra, 1. (2007). Error correcting codes: local testing, list decoding, and applications. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3626

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Patthak, Anindya Chandra, 1977-. “Error correcting codes: local testing, list decoding, and applications.” 2007. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/3626.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Patthak, Anindya Chandra, 1977-. “Error correcting codes: local testing, list decoding, and applications.” 2007. Web. 26 Jun 2019.

Vancouver:

Patthak, Anindya Chandra 1. Error correcting codes: local testing, list decoding, and applications. [Internet] [Thesis]. University of Texas – Austin; 2007. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/3626.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Patthak, Anindya Chandra 1. Error correcting codes: local testing, list decoding, and applications. [Thesis]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3626

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Texas – Austin

13. Kamp, Jesse John, 1979-. Deterministic extractors.

Degree: Computer Sciences, 2007, University of Texas – Austin

Subjects/Keywords: Random variables; Cryptography; Entropy (Information theory); Stochastic processes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kamp, Jesse John, 1. (2007). Deterministic extractors. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/13299

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kamp, Jesse John, 1979-. “Deterministic extractors.” 2007. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/13299.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kamp, Jesse John, 1979-. “Deterministic extractors.” 2007. Web. 26 Jun 2019.

Vancouver:

Kamp, Jesse John 1. Deterministic extractors. [Internet] [Thesis]. University of Texas – Austin; 2007. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/13299.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kamp, Jesse John 1. Deterministic extractors. [Thesis]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/13299

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

14. Mills, Andrew Jesse. Lower bounds and correctness results for locally decodable codes.

Degree: Computer Sciences, 2011, University of Texas – Austin

 We study fundamental properties of Locally Decodable Codes (LDCs). LDCs are motivated by the intuition that traditional codes do not have a good tradeoff between… (more)

Subjects/Keywords: Codes; Decoders; Local decodability; Lower bounds

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mills, A. J. (2011). Lower bounds and correctness results for locally decodable codes. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-08-4223

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mills, Andrew Jesse. “Lower bounds and correctness results for locally decodable codes.” 2011. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/ETD-UT-2011-08-4223.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mills, Andrew Jesse. “Lower bounds and correctness results for locally decodable codes.” 2011. Web. 26 Jun 2019.

Vancouver:

Mills AJ. Lower bounds and correctness results for locally decodable codes. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-08-4223.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mills AJ. Lower bounds and correctness results for locally decodable codes. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-08-4223

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

15. Meka, Raghu Vardhan Reddy. Computational applications of invariance principles.

Degree: Computer Sciences, 2011, University of Texas – Austin

 This thesis focuses on applications of classical tools from probability theory and convex analysis such as limit theorems to problems in theoretical computer science, specifically… (more)

Subjects/Keywords: Invariance principles; Limit theorems; Pseudorandomness; PTFs; Learning theory; Noise sensitivity; Polytopes; Halfspaces

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meka, R. V. R. (2011). Computational applications of invariance principles. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/30359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Meka, Raghu Vardhan Reddy. “Computational applications of invariance principles.” 2011. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/30359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Meka, Raghu Vardhan Reddy. “Computational applications of invariance principles.” 2011. Web. 26 Jun 2019.

Vancouver:

Meka RVR. Computational applications of invariance principles. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/30359.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Meka RVR. Computational applications of invariance principles. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/30359

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Lewko, Allison Bishop. Functional encryption : new proof techniques and advancing capabilities.

Degree: Computer Sciences, 2012, University of Texas – Austin

 We develop the dual system encryption methodology to provide fully secure functional encryption systems. We introduce new proof techniques and explore their applications, resulting in… (more)

Subjects/Keywords: Cryptography; Functional encryption

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lewko, A. B. (2012). Functional encryption : new proof techniques and advancing capabilities. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5374

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lewko, Allison Bishop. “Functional encryption : new proof techniques and advancing capabilities.” 2012. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/ETD-UT-2012-05-5374.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lewko, Allison Bishop. “Functional encryption : new proof techniques and advancing capabilities.” 2012. Web. 26 Jun 2019.

Vancouver:

Lewko AB. Functional encryption : new proof techniques and advancing capabilities. [Internet] [Thesis]. University of Texas – Austin; 2012. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5374.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lewko AB. Functional encryption : new proof techniques and advancing capabilities. [Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5374

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. Lewko, Mark J., 1983-. Combinatorial and probabilistic techniques in harmonic analysis.

Degree: Mathematics, 2012, University of Texas – Austin

 We prove several theorems in the intersection of harmonic analysis, combinatorics, probability and number theory. In the second section we use combinatorial methods to construct… (more)

Subjects/Keywords: Fourier analysis; Harmonic analysis; Combinatorics; Number theory; Probability

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lewko, Mark J., 1. (2012). Combinatorial and probabilistic techniques in harmonic analysis. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2012-05-5531

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lewko, Mark J., 1983-. “Combinatorial and probabilistic techniques in harmonic analysis.” 2012. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/ETD-UT-2012-05-5531.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lewko, Mark J., 1983-. “Combinatorial and probabilistic techniques in harmonic analysis.” 2012. Web. 26 Jun 2019.

Vancouver:

Lewko, Mark J. 1. Combinatorial and probabilistic techniques in harmonic analysis. [Internet] [Thesis]. University of Texas – Austin; 2012. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5531.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lewko, Mark J. 1. Combinatorial and probabilistic techniques in harmonic analysis. [Thesis]. University of Texas – Austin; 2012. Available from: http://hdl.handle.net/2152/ETD-UT-2012-05-5531

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

18. Agrawal, Shweta Prem. Efficient, provably secure code constructions.

Degree: Electrical and Computer Engineering, 2011, University of Texas – Austin

 The importance of constructing reliable and efficient methods for securing digital information in the modern world cannot be overstated. The urgency of this need is… (more)

Subjects/Keywords: Cryptography; Computer security; IBE; Encryption; Identity based encryption; Network coding; Compressive sensing; Message authentication codes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Agrawal, S. P. (2011). Efficient, provably secure code constructions. (Thesis). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-05-2675

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Agrawal, Shweta Prem. “Efficient, provably secure code constructions.” 2011. Thesis, University of Texas – Austin. Accessed June 26, 2019. http://hdl.handle.net/2152/ETD-UT-2011-05-2675.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Agrawal, Shweta Prem. “Efficient, provably secure code constructions.” 2011. Web. 26 Jun 2019.

Vancouver:

Agrawal SP. Efficient, provably secure code constructions. [Internet] [Thesis]. University of Texas – Austin; 2011. [cited 2019 Jun 26]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-2675.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Agrawal SP. Efficient, provably secure code constructions. [Thesis]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-05-2675

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.