Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `+publisher:"Rutgers University" +contributor:("Allender, Eric")`

.
Showing records 1 – 9 of
9 total matches.

▼ Search Limiters

1. Lutz, Neil J. Algorithmic information, fractal geometry, and distributed dynamics.

Degree: PhD, Computer Science, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/

►

This dissertation applies two distinct algorithmic perspectives to questions in the field of fractal geometry and dynamics. In Part I, we establish connections between algorithmic… (more)

Subjects/Keywords: Kolmogorov complexity

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lutz, N. J. (2017). Algorithmic information, fractal geometry, and distributed dynamics. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55576/

Chicago Manual of Style (16^{th} Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

MLA Handbook (7^{th} Edition):

Lutz, Neil J. “Algorithmic information, fractal geometry, and distributed dynamics.” 2017. Web. 25 Sep 2020.

Vancouver:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 25]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/.

Council of Science Editors:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55576/

Rutgers University

2. Bhrushundi, Abhishek, 1988-. Towards understanding the approximation of Boolean functions by nonclassical polynomials.

Degree: PhD, Nonclassical polynomials, 2020, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/64092/

►

The representation and approximation of Boolean functions by polynomials is an important area of research in theoretical computer science, having numerous applications in circuit complexity,… (more)

Subjects/Keywords: Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bhrushundi, Abhishek, 1. (2020). Towards understanding the approximation of Boolean functions by nonclassical polynomials. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/64092/

Chicago Manual of Style (16^{th} Edition):

Bhrushundi, Abhishek, 1988-. “Towards understanding the approximation of Boolean functions by nonclassical polynomials.” 2020. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/64092/.

MLA Handbook (7^{th} Edition):

Bhrushundi, Abhishek, 1988-. “Towards understanding the approximation of Boolean functions by nonclassical polynomials.” 2020. Web. 25 Sep 2020.

Vancouver:

Bhrushundi, Abhishek 1. Towards understanding the approximation of Boolean functions by nonclassical polynomials. [Internet] [Doctoral dissertation]. Rutgers University; 2020. [cited 2020 Sep 25]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64092/.

Council of Science Editors:

Bhrushundi, Abhishek 1. Towards understanding the approximation of Boolean functions by nonclassical polynomials. [Doctoral Dissertation]. Rutgers University; 2020. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64092/

3. Friedman, Luke, 1982-. Some applications of randomness in computational complexity.

Degree: Computer Science, 2013, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068854

Subjects/Keywords: Computational complexity; Random operators

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Friedman, Luke, 1. (2013). Some applications of randomness in computational complexity. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068854

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Friedman, Luke, 1982-. “Some applications of randomness in computational complexity.” 2013. Thesis, Rutgers University. Accessed September 25, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068854.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Friedman, Luke, 1982-. “Some applications of randomness in computational complexity.” 2013. Web. 25 Sep 2020.

Vancouver:

Friedman, Luke 1. Some applications of randomness in computational complexity. [Internet] [Thesis]. Rutgers University; 2013. [cited 2020 Sep 25]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068854.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Friedman, Luke 1. Some applications of randomness in computational complexity. [Thesis]. Rutgers University; 2013. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000068854

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

4. Kumar, Mrinal, 1990-. Lower bounds for bounded depth arithmetic circuits.

Degree: PhD, Computer Science, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/54175/

► Proving lower bounds for arithmetic circuits is a problem of fundamental importance in theoretical computer science. In recent years, an approach to this problem has…
(more)

Subjects/Keywords: Computer arithmetic and logic units

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kumar, Mrinal, 1. (2017). Lower bounds for bounded depth arithmetic circuits. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54175/

Chicago Manual of Style (16^{th} Edition):

Kumar, Mrinal, 1990-. “Lower bounds for bounded depth arithmetic circuits.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54175/.

MLA Handbook (7^{th} Edition):

Kumar, Mrinal, 1990-. “Lower bounds for bounded depth arithmetic circuits.” 2017. Web. 25 Sep 2020.

Vancouver:

Kumar, Mrinal 1. Lower bounds for bounded depth arithmetic circuits. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 25]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54175/.

Council of Science Editors:

Kumar, Mrinal 1. Lower bounds for bounded depth arithmetic circuits. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54175/

Rutgers University

5. Richter, Peter C. (Peter Courtland). Quantum walks and ground state problems.

Degree: PhD, Computer Science, 2007, Rutgers University

URL: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16768

►

Since the appearance of Shor's factoring algorithm in 1994, the search for novel quantum computer algorithms has proved surprisingly difficult. Two design approaches that have… (more)

Subjects/Keywords: Computer algorithms; Quantum field theory; Random walks (Mathematics)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Richter, P. C. (. C. (2007). Quantum walks and ground state problems. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16768

Chicago Manual of Style (16^{th} Edition):

Richter, Peter C (Peter Courtland). “Quantum walks and ground state problems.” 2007. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16768.

MLA Handbook (7^{th} Edition):

Richter, Peter C (Peter Courtland). “Quantum walks and ground state problems.” 2007. Web. 25 Sep 2020.

Vancouver:

Richter PC(C. Quantum walks and ground state problems. [Internet] [Doctoral dissertation]. Rutgers University; 2007. [cited 2020 Sep 25]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16768.

Council of Science Editors:

Richter PC(C. Quantum walks and ground state problems. [Doctoral Dissertation]. Rutgers University; 2007. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.16768

Rutgers University

6. Xu, Yixin, 1985-. Impossibility theorems and the universal algebraic toolkit.

Degree: PhD, Computer Science, 2015, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/48728/

►

In this dissertation, we elucidate a close connection between the theory of Evaluation Aggregation, and a subfield of universal algebra, that was recently applied to… (more)

Subjects/Keywords: Algebra

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xu, Yixin, 1. (2015). Impossibility theorems and the universal algebraic toolkit. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/48728/

Chicago Manual of Style (16^{th} Edition):

Xu, Yixin, 1985-. “Impossibility theorems and the universal algebraic toolkit.” 2015. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/48728/.

MLA Handbook (7^{th} Edition):

Xu, Yixin, 1985-. “Impossibility theorems and the universal algebraic toolkit.” 2015. Web. 25 Sep 2020.

Vancouver:

Xu, Yixin 1. Impossibility theorems and the universal algebraic toolkit. [Internet] [Doctoral dissertation]. Rutgers University; 2015. [cited 2020 Sep 25]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48728/.

Council of Science Editors:

Xu, Yixin 1. Impossibility theorems and the universal algebraic toolkit. [Doctoral Dissertation]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/48728/

Rutgers University

7. Chastain, Erick, 1984-. The multiplicative weight updates method for evolutionary biology.

Degree: PhD, Computer Science, 2017, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/52138/

►

A new and exciting direction of recent work in theoretical computer science is the application of methods from the field to evolutionary biology. Starting with… (more)

Subjects/Keywords: Evolution (Biology)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chastain, Erick, 1. (2017). The multiplicative weight updates method for evolutionary biology. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/52138/

Chicago Manual of Style (16^{th} Edition):

Chastain, Erick, 1984-. “The multiplicative weight updates method for evolutionary biology.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/52138/.

MLA Handbook (7^{th} Edition):

Chastain, Erick, 1984-. “The multiplicative weight updates method for evolutionary biology.” 2017. Web. 25 Sep 2020.

Vancouver:

Chastain, Erick 1. The multiplicative weight updates method for evolutionary biology. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 25]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52138/.

Council of Science Editors:

Chastain, Erick 1. The multiplicative weight updates method for evolutionary biology. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52138/

Rutgers University

8. Tang, Sijian, 1991-. Two problems in noise tolerant computing.

Degree: PhD, Mathematics, 2018, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/59248/

►

This thesis consists of 2 main results about computations under random noise. In both problems we consider the discrete input picked from the hamming cube… (more)

Subjects/Keywords: Random noise theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tang, Sijian, 1. (2018). Two problems in noise tolerant computing. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/59248/

Chicago Manual of Style (16^{th} Edition):

Tang, Sijian, 1991-. “Two problems in noise tolerant computing.” 2018. Doctoral Dissertation, Rutgers University. Accessed September 25, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/59248/.

MLA Handbook (7^{th} Edition):

Tang, Sijian, 1991-. “Two problems in noise tolerant computing.” 2018. Web. 25 Sep 2020.

Vancouver:

Tang, Sijian 1. Two problems in noise tolerant computing. [Internet] [Doctoral dissertation]. Rutgers University; 2018. [cited 2020 Sep 25]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/59248/.

Council of Science Editors:

Tang, Sijian 1. Two problems in noise tolerant computing. [Doctoral Dissertation]. Rutgers University; 2018. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/59248/

9. Wang, Fengming, 1980-. On circuit complexity classes and iterated matrix multiplication.

Degree: Computer Science, 2012, Rutgers University

URL: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064183

Subjects/Keywords: Programming languages (Electronic computers); Cellular automata

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wang, Fengming, 1. (2012). On circuit complexity classes and iterated matrix multiplication. (Thesis). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064183

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wang, Fengming, 1980-. “On circuit complexity classes and iterated matrix multiplication.” 2012. Thesis, Rutgers University. Accessed September 25, 2020. http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064183.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wang, Fengming, 1980-. “On circuit complexity classes and iterated matrix multiplication.” 2012. Web. 25 Sep 2020.

Vancouver:

Wang, Fengming 1. On circuit complexity classes and iterated matrix multiplication. [Internet] [Thesis]. Rutgers University; 2012. [cited 2020 Sep 25]. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064183.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang, Fengming 1. On circuit complexity classes and iterated matrix multiplication. [Thesis]. Rutgers University; 2012. Available from: http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000064183

Not specified: Masters Thesis or Doctoral Dissertation