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:"Rutgers University" +contributor:("Saraf, Shubhangi"). Showing records 1 – 16 of 16 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Lund, Benjamin, 1979-. Incidences and extremal problems on finite point sets.

Degree: PhD, Computer Science, 2017, Rutgers University

This thesis consists of three papers, each addressing a different collection of problems on the extremal combinatorics of finite point sets. The first collection of… (more)

Subjects/Keywords: Discrete geometry

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):

Lund, Benjamin, 1. (2017). Incidences and extremal problems on finite point sets. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/53694/

Chicago Manual of Style (16th Edition):

Lund, Benjamin, 1979-. “Incidences and extremal problems on finite point sets.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/53694/.

MLA Handbook (7th Edition):

Lund, Benjamin, 1979-. “Incidences and extremal problems on finite point sets.” 2017. Web. 19 Sep 2020.

Vancouver:

Lund, Benjamin 1. Incidences and extremal problems on finite point sets. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/53694/.

Council of Science Editors:

Lund, Benjamin 1. Incidences and extremal problems on finite point sets. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/53694/


Rutgers University

2. Shen, Hao, 1987-. An experimental study of the triangle algorithm with emphasis on solving a linear system.

Degree: MS, Computer Science, 2015, Rutgers University

 The triangle algorithm, Kalantari [4], is designed to solve the convex hull membership problem. It can also solve LP, and as shown in Kalantari[1] solve… (more)

Subjects/Keywords: Algorithms; Linear systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shen, Hao, 1. (2015). An experimental study of the triangle algorithm with emphasis on solving a linear system. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/46437/

Chicago Manual of Style (16th Edition):

Shen, Hao, 1987-. “An experimental study of the triangle algorithm with emphasis on solving a linear system.” 2015. Masters Thesis, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/46437/.

MLA Handbook (7th Edition):

Shen, Hao, 1987-. “An experimental study of the triangle algorithm with emphasis on solving a linear system.” 2015. Web. 19 Sep 2020.

Vancouver:

Shen, Hao 1. An experimental study of the triangle algorithm with emphasis on solving a linear system. [Internet] [Masters thesis]. Rutgers University; 2015. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46437/.

Council of Science Editors:

Shen, Hao 1. An experimental study of the triangle algorithm with emphasis on solving a linear system. [Masters Thesis]. Rutgers University; 2015. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/46437/


Rutgers University

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

Degree: PhD, Computer Science, 2017, Rutgers University

 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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Kumar, Mrinal 1. Lower bounds for bounded depth arithmetic circuits. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. 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

4. Bhangale, Amey, 1990-. Property testing, PCPs and CSPs.

Degree: PhD, Property Testing, 2017, Rutgers University

Many optimization problems can be modeled as constraint satisfaction problems (CSPs). Hence understanding the complexity of solving or approximating CSPs is a fundamental problem in… (more)

Subjects/Keywords: Computer Science; Mathematical optimization; Constraint programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhangale, Amey, 1. (2017). Property testing, PCPs and CSPs. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/53087/

Chicago Manual of Style (16th Edition):

Bhangale, Amey, 1990-. “Property testing, PCPs and CSPs.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/53087/.

MLA Handbook (7th Edition):

Bhangale, Amey, 1990-. “Property testing, PCPs and CSPs.” 2017. Web. 19 Sep 2020.

Vancouver:

Bhangale, Amey 1. Property testing, PCPs and CSPs. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/53087/.

Council of Science Editors:

Bhangale, Amey 1. Property testing, PCPs and CSPs. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/53087/


Rutgers University

5. Naumovitz, Timothy Ryan. Very efficient approximation algorithms to edit distance problems.

Degree: PhD, Mathematics, 2016, Rutgers University

This thesis deals with the question of approximating distance to monotonicity in the streaming setting as well as the task of approximating the ulam distance… (more)

Subjects/Keywords: Computer algorithms; Approximation theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naumovitz, T. R. (2016). Very efficient approximation algorithms to edit distance problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/51382/

Chicago Manual of Style (16th Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

MLA Handbook (7th Edition):

Naumovitz, Timothy Ryan. “Very efficient approximation algorithms to edit distance problems.” 2016. Web. 19 Sep 2020.

Vancouver:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Internet] [Doctoral dissertation]. Rutgers University; 2016. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/.

Council of Science Editors:

Naumovitz TR. Very efficient approximation algorithms to edit distance problems. [Doctoral Dissertation]. Rutgers University; 2016. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/51382/


Rutgers University

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

Degree: PhD, Nonclassical polynomials, 2020, Rutgers University

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

Bhrushundi, Abhishek, 1988-. “Towards understanding the approximation of Boolean functions by nonclassical polynomials.” 2020. Web. 19 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 19]. 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/


Rutgers University

7. Semonsen, Justin. Some combinatorial results on matrices and polynomials.

Degree: PhD, Mathematics, 2020, Rutgers University

This thesis studies three problems in combinatorics that concern matrices and polyno- mials. The first problem refines a technique by Scheinerman [24] to get an… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Semonsen, J. (2020). Some combinatorial results on matrices and polynomials. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/64253/

Chicago Manual of Style (16th Edition):

Semonsen, Justin. “Some combinatorial results on matrices and polynomials.” 2020. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/64253/.

MLA Handbook (7th Edition):

Semonsen, Justin. “Some combinatorial results on matrices and polynomials.” 2020. Web. 19 Sep 2020.

Vancouver:

Semonsen J. Some combinatorial results on matrices and polynomials. [Internet] [Doctoral dissertation]. Rutgers University; 2020. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64253/.

Council of Science Editors:

Semonsen J. Some combinatorial results on matrices and polynomials. [Doctoral Dissertation]. Rutgers University; 2020. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64253/


Rutgers University

8. Potukuchi, Aditya, 1990-. Combinatorial methods in algorithms and complexity theory.

Degree: PhD, Reed-Muller codes, 2020, Rutgers University

Theoretical Computer Science has connections to several areas of mathematics and one of the more prominent of these connections is to combinatorics. Indeed, many problems… (more)

Subjects/Keywords: Combinatorial analysis; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Potukuchi, Aditya, 1. (2020). Combinatorial methods in algorithms and complexity theory. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/64105/

Chicago Manual of Style (16th Edition):

Potukuchi, Aditya, 1990-. “Combinatorial methods in algorithms and complexity theory.” 2020. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/64105/.

MLA Handbook (7th Edition):

Potukuchi, Aditya, 1990-. “Combinatorial methods in algorithms and complexity theory.” 2020. Web. 19 Sep 2020.

Vancouver:

Potukuchi, Aditya 1. Combinatorial methods in algorithms and complexity theory. [Internet] [Doctoral dissertation]. Rutgers University; 2020. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64105/.

Council of Science Editors:

Potukuchi, Aditya 1. Combinatorial methods in algorithms and complexity theory. [Doctoral Dissertation]. Rutgers University; 2020. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64105/


Rutgers University

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

Degree: PhD, Computer Science, 2017, Rutgers University

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 DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th 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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Chastain, Erick 1. The multiplicative weight updates method for evolutionary biology. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. 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

10. Durak, Fatma, 1985-. Cryptanalytic study of property-preserving encryption.

Degree: PhD, Computer Science, 2017, Rutgers University

 emph{Property-preserving encryption} (PPE) provides accessible methods to encrypt the databases in an efficient way by preserving specific fuctionalities of databases. PPE as an impactful research… (more)

Subjects/Keywords: Data encryption (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Durak, Fatma, 1. (2017). Cryptanalytic study of property-preserving encryption. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/55458/

Chicago Manual of Style (16th Edition):

Durak, Fatma, 1985-. “Cryptanalytic study of property-preserving encryption.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/55458/.

MLA Handbook (7th Edition):

Durak, Fatma, 1985-. “Cryptanalytic study of property-preserving encryption.” 2017. Web. 19 Sep 2020.

Vancouver:

Durak, Fatma 1. Cryptanalytic study of property-preserving encryption. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55458/.

Council of Science Editors:

Durak, Fatma 1. Cryptanalytic study of property-preserving encryption. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/55458/

11. Wolf, Charles, 1989-. Incidence problems in discrete geometry.

Degree: PhD, Mathematics, 2017, Rutgers University

Over the past decade, discrete geometry research has flourished with clever uses of algebraic methods. The polynomial method has had a deep impact on a… (more)

Subjects/Keywords: Discrete geometry

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):

Wolf, Charles, 1. (2017). Incidence problems in discrete geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54042/

Chicago Manual of Style (16th Edition):

Wolf, Charles, 1989-. “Incidence problems in discrete geometry.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54042/.

MLA Handbook (7th Edition):

Wolf, Charles, 1989-. “Incidence problems in discrete geometry.” 2017. Web. 19 Sep 2020.

Vancouver:

Wolf, Charles 1. Incidence problems in discrete geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54042/.

Council of Science Editors:

Wolf, Charles 1. Incidence problems in discrete geometry. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54042/

12. Basit, Abdul, 1987-. Some applications of algebraic methods in combinatorial geometry.

Degree: PhD, Computer Science, 2017, Rutgers University

This dissertation explores problems in combinatorial geometry relating to incidences and to applications of incidence problems in other areas of combinatorics. In recent years, various… (more)

Subjects/Keywords: Combinatorial geometry; Combinatorial analysis

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):

Basit, Abdul, 1. (2017). Some applications of algebraic methods in combinatorial geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

Chicago Manual of Style (16th Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

MLA Handbook (7th Edition):

Basit, Abdul, 1987-. “Some applications of algebraic methods in combinatorial geometry.” 2017. Web. 19 Sep 2020.

Vancouver:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/.

Council of Science Editors:

Basit, Abdul 1. Some applications of algebraic methods in combinatorial geometry. [Doctoral Dissertation]. Rutgers University; 2017. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/54176/

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

Degree: PhD, Computer Science, 2017, Rutgers University

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

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):

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 (16th Edition):

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

MLA Handbook (7th Edition):

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

Vancouver:

Lutz NJ. Algorithmic information, fractal geometry, and distributed dynamics. [Internet] [Doctoral dissertation]. Rutgers University; 2017. [cited 2020 Sep 19]. 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/

14. Franks, William Cole, 1991-. A simple algorithm for Horn's problem and two results on discrepancy.

Degree: PhD, Horn's problem, 2019, Rutgers University

In the second chapter we consider the discrepancy of permutation families. A k – permutation family on n vertices is a set-system consisting of the intervals… (more)

Subjects/Keywords: Mathematics

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):

Franks, William Cole, 1. (2019). A simple algorithm for Horn's problem and two results on discrepancy. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/60676/

Chicago Manual of Style (16th Edition):

Franks, William Cole, 1991-. “A simple algorithm for Horn's problem and two results on discrepancy.” 2019. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/60676/.

MLA Handbook (7th Edition):

Franks, William Cole, 1991-. “A simple algorithm for Horn's problem and two results on discrepancy.” 2019. Web. 19 Sep 2020.

Vancouver:

Franks, William Cole 1. A simple algorithm for Horn's problem and two results on discrepancy. [Internet] [Doctoral dissertation]. Rutgers University; 2019. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60676/.

Council of Science Editors:

Franks, William Cole 1. A simple algorithm for Horn's problem and two results on discrepancy. [Doctoral Dissertation]. Rutgers University; 2019. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/60676/


Rutgers University

15. Desai, Devendra J., 1982-. Approximability of modularity clustering and related results.

Degree: Computer Science, 2013, Rutgers University

Subjects/Keywords: Computer algorithms; Cluster analysis – Computer programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Desai, Devendra J., 1. (2013). Approximability of modularity clustering and related results. (Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/41756/

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):

Desai, Devendra J., 1982-. “Approximability of modularity clustering and related results.” 2013. Thesis, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/41756/.

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

MLA Handbook (7th Edition):

Desai, Devendra J., 1982-. “Approximability of modularity clustering and related results.” 2013. Web. 19 Sep 2020.

Vancouver:

Desai, Devendra J. 1. Approximability of modularity clustering and related results. [Internet] [Thesis]. Rutgers University; 2013. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/41756/.

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

Council of Science Editors:

Desai, Devendra J. 1. Approximability of modularity clustering and related results. [Thesis]. Rutgers University; 2013. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/41756/

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


Rutgers University

16. Park, Jinyoung, 1982-. Problems in combinatorics: Hamming cubes and thresholds.

Degree: PhD, Asymptotic enumeration, 2020, Rutgers University

Subjects/Keywords: Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Park, Jinyoung, 1. (2020). Problems in combinatorics: Hamming cubes and thresholds. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/64308/

Chicago Manual of Style (16th Edition):

Park, Jinyoung, 1982-. “Problems in combinatorics: Hamming cubes and thresholds.” 2020. Doctoral Dissertation, Rutgers University. Accessed September 19, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/64308/.

MLA Handbook (7th Edition):

Park, Jinyoung, 1982-. “Problems in combinatorics: Hamming cubes and thresholds.” 2020. Web. 19 Sep 2020.

Vancouver:

Park, Jinyoung 1. Problems in combinatorics: Hamming cubes and thresholds. [Internet] [Doctoral dissertation]. Rutgers University; 2020. [cited 2020 Sep 19]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64308/.

Council of Science Editors:

Park, Jinyoung 1. Problems in combinatorics: Hamming cubes and thresholds. [Doctoral Dissertation]. Rutgers University; 2020. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/64308/

.