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 subject:(computer algebra). Showing records 1 – 30 of 215 total matches.

[1] [2] [3] [4] [5] [6] [7] [8]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Country

▼ Search Limiters


Linnaeus University

1. Strikic, Ana. Linear Algebra in Computer Graphics.

Degree: Mathematics, 2019, Linnaeus University

  In this thesis, we will investigate the rapidly developing eld of computergraphics by giving an insight into the calculations behind the most im-portant topics… (more)

Subjects/Keywords: Linear algebra; computer graphics; Algebra and Logic; Algebra och logik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Strikic, A. (2019). Linear Algebra in Computer Graphics. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-89168

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

Strikic, Ana. “Linear Algebra in Computer Graphics.” 2019. Thesis, Linnaeus University. Accessed August 06, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-89168.

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

MLA Handbook (7th Edition):

Strikic, Ana. “Linear Algebra in Computer Graphics.” 2019. Web. 06 Aug 2020.

Vancouver:

Strikic A. Linear Algebra in Computer Graphics. [Internet] [Thesis]. Linnaeus University; 2019. [cited 2020 Aug 06]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-89168.

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

Council of Science Editors:

Strikic A. Linear Algebra in Computer Graphics. [Thesis]. Linnaeus University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-89168

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


University of Victoria

2. Lui, Patrick Kam. Simplified theory of Boolean functions.

Degree: Department of Computer Science, 2018, University of Victoria

 A new, intuitive approach to the study of a Boolean function using its set of parities of subfunctions called the parity spectrum is presented. This… (more)

Subjects/Keywords: Computer science; Mathematics; Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lui, P. K. (2018). Simplified theory of Boolean functions. (Thesis). University of Victoria. Retrieved from https://dspace.library.uvic.ca//handle/1828/9500

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

Lui, Patrick Kam. “Simplified theory of Boolean functions.” 2018. Thesis, University of Victoria. Accessed August 06, 2020. https://dspace.library.uvic.ca//handle/1828/9500.

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

MLA Handbook (7th Edition):

Lui, Patrick Kam. “Simplified theory of Boolean functions.” 2018. Web. 06 Aug 2020.

Vancouver:

Lui PK. Simplified theory of Boolean functions. [Internet] [Thesis]. University of Victoria; 2018. [cited 2020 Aug 06]. Available from: https://dspace.library.uvic.ca//handle/1828/9500.

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

Council of Science Editors:

Lui PK. Simplified theory of Boolean functions. [Thesis]. University of Victoria; 2018. Available from: https://dspace.library.uvic.ca//handle/1828/9500

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


Virginia Tech

3. Struble, Craig Andrew. Analysis and Implementation of Algorithms for Noncommutative Algebra.

Degree: PhD, Computer Science, 2000, Virginia Tech

 A fundamental task of algebraists is to classify algebraic structures. For example, the classification of finite groups has been widely studied and has benefited from… (more)

Subjects/Keywords: computer algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Struble, C. A. (2000). Analysis and Implementation of Algorithms for Noncommutative Algebra. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/27393

Chicago Manual of Style (16th Edition):

Struble, Craig Andrew. “Analysis and Implementation of Algorithms for Noncommutative Algebra.” 2000. Doctoral Dissertation, Virginia Tech. Accessed August 06, 2020. http://hdl.handle.net/10919/27393.

MLA Handbook (7th Edition):

Struble, Craig Andrew. “Analysis and Implementation of Algorithms for Noncommutative Algebra.” 2000. Web. 06 Aug 2020.

Vancouver:

Struble CA. Analysis and Implementation of Algorithms for Noncommutative Algebra. [Internet] [Doctoral dissertation]. Virginia Tech; 2000. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10919/27393.

Council of Science Editors:

Struble CA. Analysis and Implementation of Algorithms for Noncommutative Algebra. [Doctoral Dissertation]. Virginia Tech; 2000. Available from: http://hdl.handle.net/10919/27393

4. Skal-Gerlock, Sandra. A Case Study on the Effects of a Computer Game on a Homeschooled Student's Motivation and Performance in Algebra .

Degree: 2012, California State University – San Marcos

 Mathematics is crucial in our technologically oriented world, and it is important that all children become proficient in the subject, including in algebra. Homeschooled students… (more)

Subjects/Keywords: algebra; computer; homeschool; game

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Skal-Gerlock, S. (2012). A Case Study on the Effects of a Computer Game on a Homeschooled Student's Motivation and Performance in Algebra . (Thesis). California State University – San Marcos. Retrieved from http://hdl.handle.net/10211.8/191

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

Skal-Gerlock, Sandra. “A Case Study on the Effects of a Computer Game on a Homeschooled Student's Motivation and Performance in Algebra .” 2012. Thesis, California State University – San Marcos. Accessed August 06, 2020. http://hdl.handle.net/10211.8/191.

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

MLA Handbook (7th Edition):

Skal-Gerlock, Sandra. “A Case Study on the Effects of a Computer Game on a Homeschooled Student's Motivation and Performance in Algebra .” 2012. Web. 06 Aug 2020.

Vancouver:

Skal-Gerlock S. A Case Study on the Effects of a Computer Game on a Homeschooled Student's Motivation and Performance in Algebra . [Internet] [Thesis]. California State University – San Marcos; 2012. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10211.8/191.

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

Council of Science Editors:

Skal-Gerlock S. A Case Study on the Effects of a Computer Game on a Homeschooled Student's Motivation and Performance in Algebra . [Thesis]. California State University – San Marcos; 2012. Available from: http://hdl.handle.net/10211.8/191

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


University of Waterloo

5. Heinle, Albert. Computational Approaches to Problems in Noncommutative Algebra  – Theory, Applications and Implementations.

Degree: 2016, University of Waterloo

 Noncommutative rings appear in several areas of mathematics. Most prominently, they can be used to model operator equations, such as differential or difference equations. In… (more)

Subjects/Keywords: Noncommutative Algebra; Symbolic Computation; Computer Algebra; Matrix Normal Forms; Cryptography

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heinle, A. (2016). Computational Approaches to Problems in Noncommutative Algebra  – Theory, Applications and Implementations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10948

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

Heinle, Albert. “Computational Approaches to Problems in Noncommutative Algebra  – Theory, Applications and Implementations.” 2016. Thesis, University of Waterloo. Accessed August 06, 2020. http://hdl.handle.net/10012/10948.

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

MLA Handbook (7th Edition):

Heinle, Albert. “Computational Approaches to Problems in Noncommutative Algebra  – Theory, Applications and Implementations.” 2016. Web. 06 Aug 2020.

Vancouver:

Heinle A. Computational Approaches to Problems in Noncommutative Algebra  – Theory, Applications and Implementations. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10012/10948.

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

Council of Science Editors:

Heinle A. Computational Approaches to Problems in Noncommutative Algebra  – Theory, Applications and Implementations. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10948

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


Columbia University

6. Xie, Jinyu. Property Testing of Boolean Function.

Degree: 2018, Columbia University

 The field of property testing has been studied for decades, and Boolean functions are among the most classical subjects to study in this area. In… (more)

Subjects/Keywords: Computer science; Algebra, Boolean; Distribution (Probability theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, J. (2018). Property Testing of Boolean Function. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D86X0TGD

Chicago Manual of Style (16th Edition):

Xie, Jinyu. “Property Testing of Boolean Function.” 2018. Doctoral Dissertation, Columbia University. Accessed August 06, 2020. https://doi.org/10.7916/D86X0TGD.

MLA Handbook (7th Edition):

Xie, Jinyu. “Property Testing of Boolean Function.” 2018. Web. 06 Aug 2020.

Vancouver:

Xie J. Property Testing of Boolean Function. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2020 Aug 06]. Available from: https://doi.org/10.7916/D86X0TGD.

Council of Science Editors:

Xie J. Property Testing of Boolean Function. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D86X0TGD

7. Zulkoski, Edward. Understanding and Enhancing CDCL-based SAT Solvers.

Degree: 2018, University of Waterloo

 Modern conflict-driven clause-learning (CDCL) Boolean satisfiability (SAT) solvers routinely solve formulas from industrial domains with millions of variables and clauses, despite the Boolean satisfiability problem… (more)

Subjects/Keywords: SAT Solvers; Backdoors; Computer Algebra Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zulkoski, E. (2018). Understanding and Enhancing CDCL-based SAT Solvers. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13525

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

Zulkoski, Edward. “Understanding and Enhancing CDCL-based SAT Solvers.” 2018. Thesis, University of Waterloo. Accessed August 06, 2020. http://hdl.handle.net/10012/13525.

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

MLA Handbook (7th Edition):

Zulkoski, Edward. “Understanding and Enhancing CDCL-based SAT Solvers.” 2018. Web. 06 Aug 2020.

Vancouver:

Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10012/13525.

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

Council of Science Editors:

Zulkoski E. Understanding and Enhancing CDCL-based SAT Solvers. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13525

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


University of Waterloo

8. Gupta, Somit. Hermite Forms of Polynomial Matrices.

Degree: 2011, University of Waterloo

 This thesis presents a new algorithm for computing the Hermite form of a polynomial matrix. Given a nonsingular n by n matrix A filled with… (more)

Subjects/Keywords: Computer Algebra; Matrix Normal Forms; Symbolic Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gupta, S. (2011). Hermite Forms of Polynomial Matrices. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6108

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

Gupta, Somit. “Hermite Forms of Polynomial Matrices.” 2011. Thesis, University of Waterloo. Accessed August 06, 2020. http://hdl.handle.net/10012/6108.

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

MLA Handbook (7th Edition):

Gupta, Somit. “Hermite Forms of Polynomial Matrices.” 2011. Web. 06 Aug 2020.

Vancouver:

Gupta S. Hermite Forms of Polynomial Matrices. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10012/6108.

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

Council of Science Editors:

Gupta S. Hermite Forms of Polynomial Matrices. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6108

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

9. Lugowski, Adam. Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra.

Degree: 2014, University of California – eScholarship, University of California

 This dissertation advances the state of the art for scalable high-performance graph analytics and data mining using the language of linear algebra. Many graph computations… (more)

Subjects/Keywords: Computer science; graphs; linear algebra; parallel computing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lugowski, A. (2014). Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/85f079s8

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

Lugowski, Adam. “Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra.” 2014. Thesis, University of California – eScholarship, University of California. Accessed August 06, 2020. http://www.escholarship.org/uc/item/85f079s8.

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

MLA Handbook (7th Edition):

Lugowski, Adam. “Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra.” 2014. Web. 06 Aug 2020.

Vancouver:

Lugowski A. Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra. [Internet] [Thesis]. University of California – eScholarship, University of California; 2014. [cited 2020 Aug 06]. Available from: http://www.escholarship.org/uc/item/85f079s8.

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

Council of Science Editors:

Lugowski A. Scalable Graph Algorithms in a High-Level Language Using Primitives Inspired by Linear Algebra. [Thesis]. University of California – eScholarship, University of California; 2014. Available from: http://www.escholarship.org/uc/item/85f079s8

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


Reykjavík University

10. Caltais, Georgiana, 1984-. Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics .

Degree: 2014, Reykjavík University

 One of the research areas of great importance in Computer Science is the study of the semantics of concurrent reactive systems. These are systems that… (more)

Subjects/Keywords: Tölvunarfræði; Tölvufræði; Algebra; Doktorsritgerðir; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Caltais, Georgiana, 1. (2014). Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics . (Thesis). Reykjavík University. Retrieved from http://hdl.handle.net/1946/17538

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

Caltais, Georgiana, 1984-. “Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics .” 2014. Thesis, Reykjavík University. Accessed August 06, 2020. http://hdl.handle.net/1946/17538.

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

MLA Handbook (7th Edition):

Caltais, Georgiana, 1984-. “Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics .” 2014. Web. 06 Aug 2020.

Vancouver:

Caltais, Georgiana 1. Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics . [Internet] [Thesis]. Reykjavík University; 2014. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/1946/17538.

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

Council of Science Editors:

Caltais, Georgiana 1. Coalgebraic Tools for Bisimilarity and Decorated Trace Semantics . [Thesis]. Reykjavík University; 2014. Available from: http://hdl.handle.net/1946/17538

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

11. Vialla, Bastien. Contributions à l'algèbre linéaire exacte sur corps finis et au chiffrement homomorphe : Contributions in sparse linear algebra on finite fields and homomorphic encryption.

Degree: Docteur es, Informatique, 2015, Montpellier

Cette thèse est composée de deux axes principaux, le premier portant sur le chiffrement homomorphe et le second sur l’algèbre linéaire creuse sur corps finis.… (more)

Subjects/Keywords: Cryptographie; Calcul formel; Algèbre linéaire; Calcul parallèle; Cryptography; Computer Algebra; Linear Algebra; Parallel computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vialla, B. (2015). Contributions à l'algèbre linéaire exacte sur corps finis et au chiffrement homomorphe : Contributions in sparse linear algebra on finite fields and homomorphic encryption. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2015MONTS112

Chicago Manual of Style (16th Edition):

Vialla, Bastien. “Contributions à l'algèbre linéaire exacte sur corps finis et au chiffrement homomorphe : Contributions in sparse linear algebra on finite fields and homomorphic encryption.” 2015. Doctoral Dissertation, Montpellier. Accessed August 06, 2020. http://www.theses.fr/2015MONTS112.

MLA Handbook (7th Edition):

Vialla, Bastien. “Contributions à l'algèbre linéaire exacte sur corps finis et au chiffrement homomorphe : Contributions in sparse linear algebra on finite fields and homomorphic encryption.” 2015. Web. 06 Aug 2020.

Vancouver:

Vialla B. Contributions à l'algèbre linéaire exacte sur corps finis et au chiffrement homomorphe : Contributions in sparse linear algebra on finite fields and homomorphic encryption. [Internet] [Doctoral dissertation]. Montpellier; 2015. [cited 2020 Aug 06]. Available from: http://www.theses.fr/2015MONTS112.

Council of Science Editors:

Vialla B. Contributions à l'algèbre linéaire exacte sur corps finis et au chiffrement homomorphe : Contributions in sparse linear algebra on finite fields and homomorphic encryption. [Doctoral Dissertation]. Montpellier; 2015. Available from: http://www.theses.fr/2015MONTS112


University of Stirling

12. Oaken, David R. Optimisation of definition structures & parameter values in process algebra models using evolutionary computation.

Degree: PhD, 2014, University of Stirling

 Process Algebras are a Formal Modelling methodology which are an effective tool for defining models of complex systems, particularly those involving multiple interacting processes. However,… (more)

Subjects/Keywords: 519.7; genetic algorithms; process algebra; genetic programming; optimisation; Algebra; Genetic programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oaken, D. R. (2014). Optimisation of definition structures & parameter values in process algebra models using evolutionary computation. (Doctoral Dissertation). University of Stirling. Retrieved from http://hdl.handle.net/1893/21206

Chicago Manual of Style (16th Edition):

Oaken, David R. “Optimisation of definition structures & parameter values in process algebra models using evolutionary computation.” 2014. Doctoral Dissertation, University of Stirling. Accessed August 06, 2020. http://hdl.handle.net/1893/21206.

MLA Handbook (7th Edition):

Oaken, David R. “Optimisation of definition structures & parameter values in process algebra models using evolutionary computation.” 2014. Web. 06 Aug 2020.

Vancouver:

Oaken DR. Optimisation of definition structures & parameter values in process algebra models using evolutionary computation. [Internet] [Doctoral dissertation]. University of Stirling; 2014. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/1893/21206.

Council of Science Editors:

Oaken DR. Optimisation of definition structures & parameter values in process algebra models using evolutionary computation. [Doctoral Dissertation]. University of Stirling; 2014. Available from: http://hdl.handle.net/1893/21206


Columbia University

13. Kowalczyk, Lucas. Attribute-Based Encryption for Boolean Formulas.

Degree: 2019, Columbia University

 We present attribute-based encryption (ABE) schemes for Boolean formulas that are adaptively secure under simple assumptions. Notably, our KP-ABE scheme enjoys a ciphertext size that… (more)

Subjects/Keywords: Computer science; Data encryption (Computer science); Algebra, Boolean

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kowalczyk, L. (2019). Attribute-Based Encryption for Boolean Formulas. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/d8-212y-yy33

Chicago Manual of Style (16th Edition):

Kowalczyk, Lucas. “Attribute-Based Encryption for Boolean Formulas.” 2019. Doctoral Dissertation, Columbia University. Accessed August 06, 2020. https://doi.org/10.7916/d8-212y-yy33.

MLA Handbook (7th Edition):

Kowalczyk, Lucas. “Attribute-Based Encryption for Boolean Formulas.” 2019. Web. 06 Aug 2020.

Vancouver:

Kowalczyk L. Attribute-Based Encryption for Boolean Formulas. [Internet] [Doctoral dissertation]. Columbia University; 2019. [cited 2020 Aug 06]. Available from: https://doi.org/10.7916/d8-212y-yy33.

Council of Science Editors:

Kowalczyk L. Attribute-Based Encryption for Boolean Formulas. [Doctoral Dissertation]. Columbia University; 2019. Available from: https://doi.org/10.7916/d8-212y-yy33


Johannes Gutenberg Universität Mainz

14. Labs, Oliver. Hypersurfaces with many singularities.

Degree: 2005, Johannes Gutenberg Universität Mainz

1. Teil: Bekannte Konstruktionen. Die vorliegende Arbeit gibt zunächst einen ausführlichen Überblick über die bisherigen Entwicklungen auf dem klassischen Gebiet der Hyperflächen mit vielen Singularitäten.… (more)

Subjects/Keywords: Algebraische Geometrie, Computer Algebra; algebraic geometry, computer algebra; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Labs, O. (2005). Hypersurfaces with many singularities. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2005/885/

Chicago Manual of Style (16th Edition):

Labs, Oliver. “Hypersurfaces with many singularities.” 2005. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed August 06, 2020. http://ubm.opus.hbz-nrw.de/volltexte/2005/885/.

MLA Handbook (7th Edition):

Labs, Oliver. “Hypersurfaces with many singularities.” 2005. Web. 06 Aug 2020.

Vancouver:

Labs O. Hypersurfaces with many singularities. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2005. [cited 2020 Aug 06]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2005/885/.

Council of Science Editors:

Labs O. Hypersurfaces with many singularities. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2005. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2005/885/


University of Utah

15. Lv, Jinpeng. Scalable formal verification of finite field arithmetic circuits using computer algebra techniques.

Degree: PhD, Electrical & Computer Engineering, 2012, University of Utah

 With the spread of internet and mobile devices, transferring information safelyand securely has become more important than ever. Finite fields have widespreadapplications in such domains,… (more)

Subjects/Keywords: Computer Algebra; Cryptography circuits; Equivalence checking; Finite field; Grobner Bases

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lv, J. (2012). Scalable formal verification of finite field arithmetic circuits using computer algebra techniques. (Doctoral Dissertation). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2080/rec/2132

Chicago Manual of Style (16th Edition):

Lv, Jinpeng. “Scalable formal verification of finite field arithmetic circuits using computer algebra techniques.” 2012. Doctoral Dissertation, University of Utah. Accessed August 06, 2020. http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2080/rec/2132.

MLA Handbook (7th Edition):

Lv, Jinpeng. “Scalable formal verification of finite field arithmetic circuits using computer algebra techniques.” 2012. Web. 06 Aug 2020.

Vancouver:

Lv J. Scalable formal verification of finite field arithmetic circuits using computer algebra techniques. [Internet] [Doctoral dissertation]. University of Utah; 2012. [cited 2020 Aug 06]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2080/rec/2132.

Council of Science Editors:

Lv J. Scalable formal verification of finite field arithmetic circuits using computer algebra techniques. [Doctoral Dissertation]. University of Utah; 2012. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/2080/rec/2132


Penn State University

16. Stayton, Sheri Noelle. Preservice secondary mathematics teachers' reactions to conflicting output between mathematics technologies.

Degree: MS, Curriculum and Instruction, 2016, Penn State University

 This study used task-based interviews and on-line questionnaires to investigate how six preservice secondary mathematics teachers at a large public university mathematically resolved output conflicts… (more)

Subjects/Keywords: secondary mathematics; preservice teachers; computer algebra systems; graphing calculators; technology; beliefs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stayton, S. N. (2016). Preservice secondary mathematics teachers' reactions to conflicting output between mathematics technologies. (Masters Thesis). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/27717

Chicago Manual of Style (16th Edition):

Stayton, Sheri Noelle. “Preservice secondary mathematics teachers' reactions to conflicting output between mathematics technologies.” 2016. Masters Thesis, Penn State University. Accessed August 06, 2020. https://etda.libraries.psu.edu/catalog/27717.

MLA Handbook (7th Edition):

Stayton, Sheri Noelle. “Preservice secondary mathematics teachers' reactions to conflicting output between mathematics technologies.” 2016. Web. 06 Aug 2020.

Vancouver:

Stayton SN. Preservice secondary mathematics teachers' reactions to conflicting output between mathematics technologies. [Internet] [Masters thesis]. Penn State University; 2016. [cited 2020 Aug 06]. Available from: https://etda.libraries.psu.edu/catalog/27717.

Council of Science Editors:

Stayton SN. Preservice secondary mathematics teachers' reactions to conflicting output between mathematics technologies. [Masters Thesis]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/27717


UCLA

17. Bhaskar, Siddharth. Recursion versus Tail Recursion over Abstract Structures.

Degree: Mathematics, 2015, UCLA

 There are several ways to understand computability over first-order structures. We may admit functions given by arbitrary recursive definitions, or we may restrict ourselves to… (more)

Subjects/Keywords: Logic; Computer science; Mathematics; Algebra; Recursion theory; Tail recursion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhaskar, S. (2015). Recursion versus Tail Recursion over Abstract Structures. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/30x2k93q

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

Bhaskar, Siddharth. “Recursion versus Tail Recursion over Abstract Structures.” 2015. Thesis, UCLA. Accessed August 06, 2020. http://www.escholarship.org/uc/item/30x2k93q.

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

MLA Handbook (7th Edition):

Bhaskar, Siddharth. “Recursion versus Tail Recursion over Abstract Structures.” 2015. Web. 06 Aug 2020.

Vancouver:

Bhaskar S. Recursion versus Tail Recursion over Abstract Structures. [Internet] [Thesis]. UCLA; 2015. [cited 2020 Aug 06]. Available from: http://www.escholarship.org/uc/item/30x2k93q.

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

Council of Science Editors:

Bhaskar S. Recursion versus Tail Recursion over Abstract Structures. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/30x2k93q

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


UCLA

18. Yousefi, Arman. Matrix Balancing in Lp Norms.

Degree: Computer Science, 2017, UCLA

 Matrix balancing is a preprocessing step in linear algebra computations such as the computation of eigenvalues of a matrix. Such computations are known to be… (more)

Subjects/Keywords: Computer science; algorithms; convergence rate; matrix balancing; Numerical linear algebra

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yousefi, A. (2017). Matrix Balancing in Lp Norms. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/3847b5dr

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

Yousefi, Arman. “Matrix Balancing in Lp Norms.” 2017. Thesis, UCLA. Accessed August 06, 2020. http://www.escholarship.org/uc/item/3847b5dr.

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

MLA Handbook (7th Edition):

Yousefi, Arman. “Matrix Balancing in Lp Norms.” 2017. Web. 06 Aug 2020.

Vancouver:

Yousefi A. Matrix Balancing in Lp Norms. [Internet] [Thesis]. UCLA; 2017. [cited 2020 Aug 06]. Available from: http://www.escholarship.org/uc/item/3847b5dr.

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

Council of Science Editors:

Yousefi A. Matrix Balancing in Lp Norms. [Thesis]. UCLA; 2017. Available from: http://www.escholarship.org/uc/item/3847b5dr

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


University of California – Berkeley

19. Arnold, Gilad. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes.

Degree: Computer Science, 2011, University of California – Berkeley

 Sparse matrix formats encode very large numerical matrices with relatively few nonzeros. They are typically implemented using imperative languages, with emphasis on low-level optimization. Such… (more)

Subjects/Keywords: Computer science; Compilation; Numerical Linear Algebra; Programming Languages; Verification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arnold, G. (2011). Data-Parallel Language for Correct and Efficient Sparse Matrix Codes. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/2pw6165p

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

Arnold, Gilad. “Data-Parallel Language for Correct and Efficient Sparse Matrix Codes.” 2011. Thesis, University of California – Berkeley. Accessed August 06, 2020. http://www.escholarship.org/uc/item/2pw6165p.

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

MLA Handbook (7th Edition):

Arnold, Gilad. “Data-Parallel Language for Correct and Efficient Sparse Matrix Codes.” 2011. Web. 06 Aug 2020.

Vancouver:

Arnold G. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Aug 06]. Available from: http://www.escholarship.org/uc/item/2pw6165p.

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

Council of Science Editors:

Arnold G. Data-Parallel Language for Correct and Efficient Sparse Matrix Codes. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/2pw6165p

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


University of California – Berkeley

20. Solomonik, Edgar. Provably Efficient Algorithms for Numerical Tensor Algebra.

Degree: Computer Science, 2014, University of California – Berkeley

 This thesis targets the design of parallelizable algorithms and communication-efficient parallel schedules for numerical linear algebra as well as computations with higher-order tensors. Communication is… (more)

Subjects/Keywords: Computer science; numerical linear algebra; parallel algorithms; tensor computations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Solomonik, E. (2014). Provably Efficient Algorithms for Numerical Tensor Algebra. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/00b4r0mv

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

Solomonik, Edgar. “Provably Efficient Algorithms for Numerical Tensor Algebra.” 2014. Thesis, University of California – Berkeley. Accessed August 06, 2020. http://www.escholarship.org/uc/item/00b4r0mv.

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

MLA Handbook (7th Edition):

Solomonik, Edgar. “Provably Efficient Algorithms for Numerical Tensor Algebra.” 2014. Web. 06 Aug 2020.

Vancouver:

Solomonik E. Provably Efficient Algorithms for Numerical Tensor Algebra. [Internet] [Thesis]. University of California – Berkeley; 2014. [cited 2020 Aug 06]. Available from: http://www.escholarship.org/uc/item/00b4r0mv.

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

Council of Science Editors:

Solomonik E. Provably Efficient Algorithms for Numerical Tensor Algebra. [Thesis]. University of California – Berkeley; 2014. Available from: http://www.escholarship.org/uc/item/00b4r0mv

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


Oregon State University

21. Bayley, Garland J. Al-Khorezmi : an intelligent algebra tutoring system.

Degree: PhD, Computer Science, 1988, Oregon State University

 This thesis presents our investigation of the problem of creating an intelligent tutor for solving algebra word problems that employs effective pedagogy. Among our major… (more)

Subjects/Keywords: Algebra  – Computer-assisted instruction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bayley, G. J. (1988). Al-Khorezmi : an intelligent algebra tutoring system. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/39855

Chicago Manual of Style (16th Edition):

Bayley, Garland J. “Al-Khorezmi : an intelligent algebra tutoring system.” 1988. Doctoral Dissertation, Oregon State University. Accessed August 06, 2020. http://hdl.handle.net/1957/39855.

MLA Handbook (7th Edition):

Bayley, Garland J. “Al-Khorezmi : an intelligent algebra tutoring system.” 1988. Web. 06 Aug 2020.

Vancouver:

Bayley GJ. Al-Khorezmi : an intelligent algebra tutoring system. [Internet] [Doctoral dissertation]. Oregon State University; 1988. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/1957/39855.

Council of Science Editors:

Bayley GJ. Al-Khorezmi : an intelligent algebra tutoring system. [Doctoral Dissertation]. Oregon State University; 1988. Available from: http://hdl.handle.net/1957/39855


University of Pennsylvania

22. Wang, Anduo. Automated Formal Analysis of Internet Routing Configurations.

Degree: 2013, University of Pennsylvania

 Today's Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomous systems (ASes). To… (more)

Subjects/Keywords: Formal Verification; Internet Routing; Reduction; Routing Algebra; Safety Analysis; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, A. (2013). Automated Formal Analysis of Internet Routing Configurations. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/814

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

Wang, Anduo. “Automated Formal Analysis of Internet Routing Configurations.” 2013. Thesis, University of Pennsylvania. Accessed August 06, 2020. https://repository.upenn.edu/edissertations/814.

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

MLA Handbook (7th Edition):

Wang, Anduo. “Automated Formal Analysis of Internet Routing Configurations.” 2013. Web. 06 Aug 2020.

Vancouver:

Wang A. Automated Formal Analysis of Internet Routing Configurations. [Internet] [Thesis]. University of Pennsylvania; 2013. [cited 2020 Aug 06]. Available from: https://repository.upenn.edu/edissertations/814.

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

Council of Science Editors:

Wang A. Automated Formal Analysis of Internet Routing Configurations. [Thesis]. University of Pennsylvania; 2013. Available from: https://repository.upenn.edu/edissertations/814

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


University of Kansas

23. Pellerito, Fred Leonard. THE EFFECTS OF TECHNOLOGY ENRICHED MATHEMATICS INSTRUCTION ON AT-RISK SECONDARY SCHOOL STUDENTS.

Degree: EdD, Educational Leadership and Policy Studies, 2011, University of Kansas

 An obstacle to student learning with many at-risk students is not the lack of ability of the student, but rather the inability of the school… (more)

Subjects/Keywords: Education; Technology; Secondary education; Algebra; Alternative; At-risk; Cbi; Computer-based

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pellerito, F. L. (2011). THE EFFECTS OF TECHNOLOGY ENRICHED MATHEMATICS INSTRUCTION ON AT-RISK SECONDARY SCHOOL STUDENTS. (Doctoral Dissertation). University of Kansas. Retrieved from http://hdl.handle.net/1808/7934

Chicago Manual of Style (16th Edition):

Pellerito, Fred Leonard. “THE EFFECTS OF TECHNOLOGY ENRICHED MATHEMATICS INSTRUCTION ON AT-RISK SECONDARY SCHOOL STUDENTS.” 2011. Doctoral Dissertation, University of Kansas. Accessed August 06, 2020. http://hdl.handle.net/1808/7934.

MLA Handbook (7th Edition):

Pellerito, Fred Leonard. “THE EFFECTS OF TECHNOLOGY ENRICHED MATHEMATICS INSTRUCTION ON AT-RISK SECONDARY SCHOOL STUDENTS.” 2011. Web. 06 Aug 2020.

Vancouver:

Pellerito FL. THE EFFECTS OF TECHNOLOGY ENRICHED MATHEMATICS INSTRUCTION ON AT-RISK SECONDARY SCHOOL STUDENTS. [Internet] [Doctoral dissertation]. University of Kansas; 2011. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/1808/7934.

Council of Science Editors:

Pellerito FL. THE EFFECTS OF TECHNOLOGY ENRICHED MATHEMATICS INSTRUCTION ON AT-RISK SECONDARY SCHOOL STUDENTS. [Doctoral Dissertation]. University of Kansas; 2011. Available from: http://hdl.handle.net/1808/7934


Oregon State University

24. Lwo, Lwun-syin. Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems.

Degree: PhD, Science Education, 1992, Oregon State University

 The purpose of the present investigation was to develop an adaptive teaching model for an interactive computer-assisted instruction (CAT) program and to evaluate the effectiveness… (more)

Subjects/Keywords: Algebra  – Computer-assisted instruction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lwo, L. (1992). Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems. (Doctoral Dissertation). Oregon State University. Retrieved from http://hdl.handle.net/1957/9173

Chicago Manual of Style (16th Edition):

Lwo, Lwun-syin. “Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems.” 1992. Doctoral Dissertation, Oregon State University. Accessed August 06, 2020. http://hdl.handle.net/1957/9173.

MLA Handbook (7th Edition):

Lwo, Lwun-syin. “Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems.” 1992. Web. 06 Aug 2020.

Vancouver:

Lwo L. Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems. [Internet] [Doctoral dissertation]. Oregon State University; 1992. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/1957/9173.

Council of Science Editors:

Lwo L. Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems. [Doctoral Dissertation]. Oregon State University; 1992. Available from: http://hdl.handle.net/1957/9173


University of Ottawa

25. Dovlo, Edem. Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates .

Degree: 2011, University of Ottawa

 The Fourier transform is one of the most useful tools in science and engineering and can be expanded to multi-dimensions and curvilinear coordinates. Multidimensional Fourier… (more)

Subjects/Keywords: 2D Fourier Transform; Polar coordinates; Symbolic Computer Algebra; Symbolic Computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dovlo, E. (2011). Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/20269

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

Dovlo, Edem. “Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates .” 2011. Thesis, University of Ottawa. Accessed August 06, 2020. http://hdl.handle.net/10393/20269.

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

MLA Handbook (7th Edition):

Dovlo, Edem. “Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates .” 2011. Web. 06 Aug 2020.

Vancouver:

Dovlo E. Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates . [Internet] [Thesis]. University of Ottawa; 2011. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10393/20269.

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

Council of Science Editors:

Dovlo E. Development of a Symbolic Computer Algebra Toolbox for 2D Fourier Transforms in Polar Coordinates . [Thesis]. University of Ottawa; 2011. Available from: http://hdl.handle.net/10393/20269

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


University of Cambridge

26. Li, Wenda. Towards justifying computer algebra algorithms in Isabelle/HOL.

Degree: PhD, 2019, University of Cambridge

 As verification efforts using interactive theorem proving grow, we are in need of certified algorithms in computer algebra to tackle problems over the real numbers.… (more)

Subjects/Keywords: formal verification; theorem proving; Isabelle/HOL; computer algebra; cylindrical algebraic decomposition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, W. (2019). Towards justifying computer algebra algorithms in Isabelle/HOL. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/289389

Chicago Manual of Style (16th Edition):

Li, Wenda. “Towards justifying computer algebra algorithms in Isabelle/HOL.” 2019. Doctoral Dissertation, University of Cambridge. Accessed August 06, 2020. https://www.repository.cam.ac.uk/handle/1810/289389.

MLA Handbook (7th Edition):

Li, Wenda. “Towards justifying computer algebra algorithms in Isabelle/HOL.” 2019. Web. 06 Aug 2020.

Vancouver:

Li W. Towards justifying computer algebra algorithms in Isabelle/HOL. [Internet] [Doctoral dissertation]. University of Cambridge; 2019. [cited 2020 Aug 06]. Available from: https://www.repository.cam.ac.uk/handle/1810/289389.

Council of Science Editors:

Li W. Towards justifying computer algebra algorithms in Isabelle/HOL. [Doctoral Dissertation]. University of Cambridge; 2019. Available from: https://www.repository.cam.ac.uk/handle/1810/289389


University of Colorado

27. Karlin, Ian. Runtime Prediction of Fused Linear Algebra in a Compiler Framework.

Degree: PhD, Computer Science, 2011, University of Colorado

  On modern processors, data transfer exceeds floating-point operations as the predominant cost in many linear algebra computations. For these memory-bound calculations, reducing data movement… (more)

Subjects/Keywords: Auto-tuning; Linear Algebra; Memory Modeling; Performance Tuning; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karlin, I. (2011). Runtime Prediction of Fused Linear Algebra in a Compiler Framework. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/26

Chicago Manual of Style (16th Edition):

Karlin, Ian. “Runtime Prediction of Fused Linear Algebra in a Compiler Framework.” 2011. Doctoral Dissertation, University of Colorado. Accessed August 06, 2020. https://scholar.colorado.edu/csci_gradetds/26.

MLA Handbook (7th Edition):

Karlin, Ian. “Runtime Prediction of Fused Linear Algebra in a Compiler Framework.” 2011. Web. 06 Aug 2020.

Vancouver:

Karlin I. Runtime Prediction of Fused Linear Algebra in a Compiler Framework. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2020 Aug 06]. Available from: https://scholar.colorado.edu/csci_gradetds/26.

Council of Science Editors:

Karlin I. Runtime Prediction of Fused Linear Algebra in a Compiler Framework. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/csci_gradetds/26


University of Colorado

28. Hossain, Javed. Lighthouse Taxonomy: Delivering Solutions for Sparse Linear Systems.

Degree: MS, Computer Science, 2013, University of Colorado

  Many different fields of science and engineering rely on linear algebra computations for solving problems and creating simulations. These computations are expensive and can… (more)

Subjects/Keywords: simulations; matrix algebra software; Lighthouse; LAPACK; PETSc; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hossain, J. (2013). Lighthouse Taxonomy: Delivering Solutions for Sparse Linear Systems. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/csci_gradetds/76

Chicago Manual of Style (16th Edition):

Hossain, Javed. “Lighthouse Taxonomy: Delivering Solutions for Sparse Linear Systems.” 2013. Masters Thesis, University of Colorado. Accessed August 06, 2020. https://scholar.colorado.edu/csci_gradetds/76.

MLA Handbook (7th Edition):

Hossain, Javed. “Lighthouse Taxonomy: Delivering Solutions for Sparse Linear Systems.” 2013. Web. 06 Aug 2020.

Vancouver:

Hossain J. Lighthouse Taxonomy: Delivering Solutions for Sparse Linear Systems. [Internet] [Masters thesis]. University of Colorado; 2013. [cited 2020 Aug 06]. Available from: https://scholar.colorado.edu/csci_gradetds/76.

Council of Science Editors:

Hossain J. Lighthouse Taxonomy: Delivering Solutions for Sparse Linear Systems. [Masters Thesis]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/csci_gradetds/76


University of Waterloo

29. Roche, Daniel Steven. Efficient Computation with Sparse and Dense Polynomials.

Degree: 2011, University of Waterloo

 Computations with polynomials are at the heart of any computer algebra system and also have many applications in engineering, coding theory, and cryptography. Generally speaking,… (more)

Subjects/Keywords: computer algebra; symbolic computation; polynomials; multiplication; interpolation; perfect powers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roche, D. S. (2011). Efficient Computation with Sparse and Dense Polynomials. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5869

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

Roche, Daniel Steven. “Efficient Computation with Sparse and Dense Polynomials.” 2011. Thesis, University of Waterloo. Accessed August 06, 2020. http://hdl.handle.net/10012/5869.

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

MLA Handbook (7th Edition):

Roche, Daniel Steven. “Efficient Computation with Sparse and Dense Polynomials.” 2011. Web. 06 Aug 2020.

Vancouver:

Roche DS. Efficient Computation with Sparse and Dense Polynomials. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Aug 06]. Available from: http://hdl.handle.net/10012/5869.

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

Council of Science Editors:

Roche DS. Efficient Computation with Sparse and Dense Polynomials. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/5869

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


University of Oxford

30. Mestel, David. Quantifying information flow.

Degree: PhD, 2018, University of Oxford

 The main problem addressed by this thesis is that of characterising information leakage channels in interactive systems as either 'dangerous' or 'safe', on the basis… (more)

Subjects/Keywords: Process algebra; Automata theory; Foundations of computer security; Discrete mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mestel, D. (2018). Quantifying information flow. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565

Chicago Manual of Style (16th Edition):

Mestel, David. “Quantifying information flow.” 2018. Doctoral Dissertation, University of Oxford. Accessed August 06, 2020. http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565.

MLA Handbook (7th Edition):

Mestel, David. “Quantifying information flow.” 2018. Web. 06 Aug 2020.

Vancouver:

Mestel D. Quantifying information flow. [Internet] [Doctoral dissertation]. University of Oxford; 2018. [cited 2020 Aug 06]. Available from: http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565.

Council of Science Editors:

Mestel D. Quantifying information flow. [Doctoral Dissertation]. University of Oxford; 2018. Available from: http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565

[1] [2] [3] [4] [5] [6] [7] [8]

.