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:"Worcester Polytechnic Institute" +contributor:("William J. Martin, Advisor"). Showing records 1 – 6 of 6 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Steele, Corre. Popping Bubbles: Cryptanalysis of Homomorphic Encryption.

Degree: MS, 2016, Worcester Polytechnic Institute

  Imagine an encryption scheme where it is possible to add and multiply numbers without any knowledge of the numbers. Instead one could manipulate encryptions… (more)

Subjects/Keywords: homomorphic encryption; cryptanalysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steele, C. (2016). Popping Bubbles: Cryptanalysis of Homomorphic Encryption. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-042816-121941 ; https://digitalcommons.wpi.edu/etd-theses/453

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

Steele, Corre. “Popping Bubbles: Cryptanalysis of Homomorphic Encryption.” 2016. Thesis, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-042816-121941 ; https://digitalcommons.wpi.edu/etd-theses/453.

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

MLA Handbook (7th Edition):

Steele, Corre. “Popping Bubbles: Cryptanalysis of Homomorphic Encryption.” 2016. Web. 10 Jul 2020.

Vancouver:

Steele C. Popping Bubbles: Cryptanalysis of Homomorphic Encryption. [Internet] [Thesis]. Worcester Polytechnic Institute; 2016. [cited 2020 Jul 10]. Available from: etd-042816-121941 ; https://digitalcommons.wpi.edu/etd-theses/453.

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

Council of Science Editors:

Steele C. Popping Bubbles: Cryptanalysis of Homomorphic Encryption. [Thesis]. Worcester Polytechnic Institute; 2016. Available from: etd-042816-121941 ; https://digitalcommons.wpi.edu/etd-theses/453

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

2. Li, Chao. Semidefinite programming, binary codes and a graph coloring problem.

Degree: MS, 2015, Worcester Polytechnic Institute

 "Experts in information theory have long been interested in the maximal size, A(n, d), of a binary error-correcting code of length n and minimum distance… (more)

Subjects/Keywords: semidefinite programming; binary codes; code size

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, C. (2015). Semidefinite programming, binary codes and a graph coloring problem. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-052915-161217 ; https://digitalcommons.wpi.edu/etd-theses/863

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, Chao. “Semidefinite programming, binary codes and a graph coloring problem.” 2015. Thesis, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-052915-161217 ; https://digitalcommons.wpi.edu/etd-theses/863.

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

MLA Handbook (7th Edition):

Li, Chao. “Semidefinite programming, binary codes and a graph coloring problem.” 2015. Web. 10 Jul 2020.

Vancouver:

Li C. Semidefinite programming, binary codes and a graph coloring problem. [Internet] [Thesis]. Worcester Polytechnic Institute; 2015. [cited 2020 Jul 10]. Available from: etd-052915-161217 ; https://digitalcommons.wpi.edu/etd-theses/863.

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

Council of Science Editors:

Li C. Semidefinite programming, binary codes and a graph coloring problem. [Thesis]. Worcester Polytechnic Institute; 2015. Available from: etd-052915-161217 ; https://digitalcommons.wpi.edu/etd-theses/863

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

3. Kodalen, Brian G. Cometric Association Schemes.

Degree: PhD, 2019, Worcester Polytechnic Institute

  The combinatorial objects known as association schemes arise in group theory, extremal graph theory, coding theory, the design of experiments, and even quantum information… (more)

Subjects/Keywords: Association schemes; Commutative algebra; Graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kodalen, B. G. (2019). Cometric Association Schemes. (Doctoral Dissertation). Worcester Polytechnic Institute. Retrieved from etd-042219-125142 ; https://digitalcommons.wpi.edu/etd-dissertations/512

Chicago Manual of Style (16th Edition):

Kodalen, Brian G. “Cometric Association Schemes.” 2019. Doctoral Dissertation, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-042219-125142 ; https://digitalcommons.wpi.edu/etd-dissertations/512.

MLA Handbook (7th Edition):

Kodalen, Brian G. “Cometric Association Schemes.” 2019. Web. 10 Jul 2020.

Vancouver:

Kodalen BG. Cometric Association Schemes. [Internet] [Doctoral dissertation]. Worcester Polytechnic Institute; 2019. [cited 2020 Jul 10]. Available from: etd-042219-125142 ; https://digitalcommons.wpi.edu/etd-dissertations/512.

Council of Science Editors:

Kodalen BG. Cometric Association Schemes. [Doctoral Dissertation]. Worcester Polytechnic Institute; 2019. Available from: etd-042219-125142 ; https://digitalcommons.wpi.edu/etd-dissertations/512

4. Nahabedian, Aaron Joseph. A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem.

Degree: MS, 2010, Worcester Polytechnic Institute

  The multicommodity flow problem involves shipping multiple commodities simultaneously through a network so that the total flow over each edge does not exceed the… (more)

Subjects/Keywords: approximation algorithm; network flow

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nahabedian, A. J. (2010). A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-042910-160853 ; https://digitalcommons.wpi.edu/etd-theses/474

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

Nahabedian, Aaron Joseph. “A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem.” 2010. Thesis, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-042910-160853 ; https://digitalcommons.wpi.edu/etd-theses/474.

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

MLA Handbook (7th Edition):

Nahabedian, Aaron Joseph. “A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem.” 2010. Web. 10 Jul 2020.

Vancouver:

Nahabedian AJ. A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem. [Internet] [Thesis]. Worcester Polytechnic Institute; 2010. [cited 2020 Jul 10]. Available from: etd-042910-160853 ; https://digitalcommons.wpi.edu/etd-theses/474.

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

Council of Science Editors:

Nahabedian AJ. A Primal-Dual Approximation Algorithm for the Concurrent Flow Problem. [Thesis]. Worcester Polytechnic Institute; 2010. Available from: etd-042910-160853 ; https://digitalcommons.wpi.edu/etd-theses/474

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

5. Adler, Jonathan D. Graph Decompositions and Monadic Second Order Logic.

Degree: MS, 2009, Worcester Polytechnic Institute

  A tree decomposition is a tool which allows for analysis of the underlying tree structure of graphs which are not trees. Given a class… (more)

Subjects/Keywords: clique width; tree decompositions; logic; graph theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Adler, J. D. (2009). Graph Decompositions and Monadic Second Order Logic. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364

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

Adler, Jonathan D. “Graph Decompositions and Monadic Second Order Logic.” 2009. Thesis, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364.

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

MLA Handbook (7th Edition):

Adler, Jonathan D. “Graph Decompositions and Monadic Second Order Logic.” 2009. Web. 10 Jul 2020.

Vancouver:

Adler JD. Graph Decompositions and Monadic Second Order Logic. [Internet] [Thesis]. Worcester Polytechnic Institute; 2009. [cited 2020 Jul 10]. Available from: etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364.

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

Council of Science Editors:

Adler JD. Graph Decompositions and Monadic Second Order Logic. [Thesis]. Worcester Polytechnic Institute; 2009. Available from: etd-042709-164059 ; https://digitalcommons.wpi.edu/etd-theses/364

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

6. Pehlivanoglu, Serdar. Rijndael Circuit Level Cryptanalysis.

Degree: MS, 2005, Worcester Polytechnic Institute

  The Rijndael cipher was chosen as the Advanced Encryption Standard (AES) in August 1999. Its internal structure exhibits unusual properties such as a clean… (more)

Subjects/Keywords: computational complexity; private-key cryptography; Advanced Encryption Standard; Rijndael; cryptanalysis; K-secure; hermetic; block cipher; circuit complexity; Cryptography; Computational complexity; Data encryption (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pehlivanoglu, S. (2005). Rijndael Circuit Level Cryptanalysis. (Thesis). Worcester Polytechnic Institute. Retrieved from etd-050505-121816 ; https://digitalcommons.wpi.edu/etd-theses/734

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

Pehlivanoglu, Serdar. “Rijndael Circuit Level Cryptanalysis.” 2005. Thesis, Worcester Polytechnic Institute. Accessed July 10, 2020. etd-050505-121816 ; https://digitalcommons.wpi.edu/etd-theses/734.

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

MLA Handbook (7th Edition):

Pehlivanoglu, Serdar. “Rijndael Circuit Level Cryptanalysis.” 2005. Web. 10 Jul 2020.

Vancouver:

Pehlivanoglu S. Rijndael Circuit Level Cryptanalysis. [Internet] [Thesis]. Worcester Polytechnic Institute; 2005. [cited 2020 Jul 10]. Available from: etd-050505-121816 ; https://digitalcommons.wpi.edu/etd-theses/734.

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

Council of Science Editors:

Pehlivanoglu S. Rijndael Circuit Level Cryptanalysis. [Thesis]. Worcester Polytechnic Institute; 2005. Available from: etd-050505-121816 ; https://digitalcommons.wpi.edu/etd-theses/734

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

.