Advanced search options

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

You searched for `subject:(theoretical computer science)`

.
Showing records 1 – 30 of
85 total matches.

Search Limiters

Dates

- 2015 – 2019 (40)
- 2010 – 2014 (33)
- 2005 – 2009 (16)

Country

- US (27)
- Switzerland (12)
- Canada (10)

▼ Search Limiters

University of Georgia

1. Purewal, Tarsem Singh. Nondeterministic complexity in quantum and classical models of computation.

Degree: PhD, Computer Science, 2007, University of Georgia

URL: http://purl.galileo.usg.edu/uga_etd/purewal_tarsem_s_200705_phd

► Nondeterminism has played a fundamental role in our understanding of clas-sical computational complexity. In particular, it led to NP-completeness, whichis one of the most important…
(more)

Subjects/Keywords: Theoretical Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Purewal, T. S. (2007). Nondeterministic complexity in quantum and classical models of computation. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/purewal_tarsem_s_200705_phd

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

Purewal, Tarsem Singh. “Nondeterministic complexity in quantum and classical models of computation.” 2007. Doctoral Dissertation, University of Georgia. Accessed December 09, 2019. http://purl.galileo.usg.edu/uga_etd/purewal_tarsem_s_200705_phd.

MLA Handbook (7^{th} Edition):

Purewal, Tarsem Singh. “Nondeterministic complexity in quantum and classical models of computation.” 2007. Web. 09 Dec 2019.

Vancouver:

Purewal TS. Nondeterministic complexity in quantum and classical models of computation. [Internet] [Doctoral dissertation]. University of Georgia; 2007. [cited 2019 Dec 09]. Available from: http://purl.galileo.usg.edu/uga_etd/purewal_tarsem_s_200705_phd.

Council of Science Editors:

Purewal TS. Nondeterministic complexity in quantum and classical models of computation. [Doctoral Dissertation]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/purewal_tarsem_s_200705_phd

2. Riechers, Paul Michael. Exact Results Regarding the Physics of Complex Systems via Linear Algebra, Hidden Markov Models, and Information Theory.

Degree: 2017, University of California, Davis

URL: http://pqdtopen.proquest.com/#viewpdf?dispub=10247020

► How can we ever make sense of what we observe? As a practical matter, most complex systems – that is, many-bodied systems with strongly interacting…
(more)

Subjects/Keywords: Physics; Theoretical physics; Computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Riechers, P. M. (2017). Exact Results Regarding the Physics of Complex Systems via Linear Algebra, Hidden Markov Models, and Information Theory. (Thesis). University of California, Davis. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=10247020

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Riechers, Paul Michael. “Exact Results Regarding the Physics of Complex Systems via Linear Algebra, Hidden Markov Models, and Information Theory.” 2017. Thesis, University of California, Davis. Accessed December 09, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10247020.

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Riechers, Paul Michael. “Exact Results Regarding the Physics of Complex Systems via Linear Algebra, Hidden Markov Models, and Information Theory.” 2017. Web. 09 Dec 2019.

Vancouver:

Riechers PM. Exact Results Regarding the Physics of Complex Systems via Linear Algebra, Hidden Markov Models, and Information Theory. [Internet] [Thesis]. University of California, Davis; 2017. [cited 2019 Dec 09]. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10247020.

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Riechers PM. Exact Results Regarding the Physics of Complex Systems via Linear Algebra, Hidden Markov Models, and Information Theory. [Thesis]. University of California, Davis; 2017. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10247020

Not specified: Masters Thesis or Doctoral Dissertation

3. Uurtamo, Steve. Several Theorems in Error Correcting Codes.

Degree: 2013, State University of New York at Buffalo

URL: http://pqdtopen.proquest.com/#viewpdf?dispub=3554516

This work collects together several problems in coding theory along with their solutions.

Subjects/Keywords: Mathematics; Theoretical Mathematics; Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Uurtamo, S. (2013). Several Theorems in Error Correcting Codes. (Thesis). State University of New York at Buffalo. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=3554516

Not specified: Masters Thesis or Doctoral Dissertation

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

Uurtamo, Steve. “Several Theorems in Error Correcting Codes.” 2013. Thesis, State University of New York at Buffalo. Accessed December 09, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=3554516.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Uurtamo, Steve. “Several Theorems in Error Correcting Codes.” 2013. Web. 09 Dec 2019.

Vancouver:

Uurtamo S. Several Theorems in Error Correcting Codes. [Internet] [Thesis]. State University of New York at Buffalo; 2013. [cited 2019 Dec 09]. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3554516.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Uurtamo S. Several Theorems in Error Correcting Codes. [Thesis]. State University of New York at Buffalo; 2013. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=3554516

Not specified: Masters Thesis or Doctoral Dissertation

4. Xie, Jingnan. Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata.

Degree: 2017, State University of New York at Albany

URL: http://pqdtopen.proquest.com/#viewpdf?dispub=10272502

► In this dissertation, we emphasize productiveness not just undecidability since pro- ductiveness implies constructive incompleteness. Analogues of Rice?s Theorem for different classes of languages…
(more)

Subjects/Keywords: Theoretical mathematics; Computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Xie, J. (2017). Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata. (Thesis). State University of New York at Albany. Retrieved from http://pqdtopen.proquest.com/#viewpdf?dispub=10272502

Not specified: Masters Thesis or Doctoral Dissertation

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

Xie, Jingnan. “Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata.” 2017. Thesis, State University of New York at Albany. Accessed December 09, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10272502.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Xie, Jingnan. “Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata.” 2017. Web. 09 Dec 2019.

Vancouver:

Xie J. Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata. [Internet] [Thesis]. State University of New York at Albany; 2017. [cited 2019 Dec 09]. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10272502.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xie J. Complexity Theoretic Parallels Among Automata, Formal Languages and Real Variables Including Multi-Patterns, L-Systems and Cellular Automata. [Thesis]. State University of New York at Albany; 2017. Available from: http://pqdtopen.proquest.com/#viewpdf?dispub=10272502

Not specified: Masters Thesis or Doctoral Dissertation

University of California – Santa Cruz

5. Black, Hadley. A Directed Isoperimetric Theorem for Boolean Functions over Hypergrids with Applications to Monotonicity Testing.

Degree: Computer Science, 2018, University of California – Santa Cruz

URL: http://www.escholarship.org/uc/item/1wd6v2jp

► We study monotonicity testing of Boolean functions over the hypergrid [n]^{d} and design a non-adaptive tester with 1-sided error whose query complexity is O(d^{5/6}) poly(log…
(more)

Subjects/Keywords: Computer science; Mathematics; Theoretical mathematics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Black, H. (2018). A Directed Isoperimetric Theorem for Boolean Functions over Hypergrids with Applications to Monotonicity Testing. (Thesis). University of California – Santa Cruz. Retrieved from http://www.escholarship.org/uc/item/1wd6v2jp

Not specified: Masters Thesis or Doctoral Dissertation

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

Black, Hadley. “A Directed Isoperimetric Theorem for Boolean Functions over Hypergrids with Applications to Monotonicity Testing.” 2018. Thesis, University of California – Santa Cruz. Accessed December 09, 2019. http://www.escholarship.org/uc/item/1wd6v2jp.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Black, Hadley. “A Directed Isoperimetric Theorem for Boolean Functions over Hypergrids with Applications to Monotonicity Testing.” 2018. Web. 09 Dec 2019.

Vancouver:

Black H. A Directed Isoperimetric Theorem for Boolean Functions over Hypergrids with Applications to Monotonicity Testing. [Internet] [Thesis]. University of California – Santa Cruz; 2018. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/1wd6v2jp.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Black H. A Directed Isoperimetric Theorem for Boolean Functions over Hypergrids with Applications to Monotonicity Testing. [Thesis]. University of California – Santa Cruz; 2018. Available from: http://www.escholarship.org/uc/item/1wd6v2jp

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

6. Yamada, Norihiro. Games as mathematics of logic and computation.

Degree: PhD, 2017, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:e2925cf3-571d-4ecb-9d12-78483f160a56 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780394

► Mathematical logic and *theoretical* *computer* *science* are the mathematical studies of logic and computation, respectively, which largely correspond to each other notably by the Curry-Howard…
(more)

Subjects/Keywords: Mathematics; Logic; Theoretical Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yamada, N. (2017). Games as mathematics of logic and computation. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:e2925cf3-571d-4ecb-9d12-78483f160a56 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780394

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

Yamada, Norihiro. “Games as mathematics of logic and computation.” 2017. Doctoral Dissertation, University of Oxford. Accessed December 09, 2019. http://ora.ox.ac.uk/objects/uuid:e2925cf3-571d-4ecb-9d12-78483f160a56 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780394.

MLA Handbook (7^{th} Edition):

Yamada, Norihiro. “Games as mathematics of logic and computation.” 2017. Web. 09 Dec 2019.

Vancouver:

Yamada N. Games as mathematics of logic and computation. [Internet] [Doctoral dissertation]. University of Oxford; 2017. [cited 2019 Dec 09]. Available from: http://ora.ox.ac.uk/objects/uuid:e2925cf3-571d-4ecb-9d12-78483f160a56 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780394.

Council of Science Editors:

Yamada N. Games as mathematics of logic and computation. [Doctoral Dissertation]. University of Oxford; 2017. Available from: http://ora.ox.ac.uk/objects/uuid:e2925cf3-571d-4ecb-9d12-78483f160a56 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.780394

Universiteit Utrecht

7. Bongaerts, J. Topological Convergence in Infinitary Abstract Rewriting.

Degree: 2011, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/209951

► Rewriting is a field on the border of logic, mathematics and *theoretical* *computer* *science*. It studies the stepwise transformation of objects and as such applies…
(more)

Subjects/Keywords: rewriting; infinity; topology; logic; theoretical computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Bongaerts, J. (2011). Topological Convergence in Infinitary Abstract Rewriting. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/209951

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

Bongaerts, J. “Topological Convergence in Infinitary Abstract Rewriting.” 2011. Masters Thesis, Universiteit Utrecht. Accessed December 09, 2019. http://dspace.library.uu.nl:8080/handle/1874/209951.

MLA Handbook (7^{th} Edition):

Bongaerts, J. “Topological Convergence in Infinitary Abstract Rewriting.” 2011. Web. 09 Dec 2019.

Vancouver:

Bongaerts J. Topological Convergence in Infinitary Abstract Rewriting. [Internet] [Masters thesis]. Universiteit Utrecht; 2011. [cited 2019 Dec 09]. Available from: http://dspace.library.uu.nl:8080/handle/1874/209951.

Council of Science Editors:

Bongaerts J. Topological Convergence in Infinitary Abstract Rewriting. [Masters Thesis]. Universiteit Utrecht; 2011. Available from: http://dspace.library.uu.nl:8080/handle/1874/209951

University of Illinois – Chicago

8. Kun, Jeremy J. Graphs, New Models, and Complexity.

Degree: 2016, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/20977

► Over the past few decades the internet and social networks became central to our society. As a consequence, the study of networks and the algorithmic…
(more)

Subjects/Keywords: computational complexity; graphs; resilience; theoretical computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kun, J. J. (2016). Graphs, New Models, and Complexity. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/20977

Not specified: Masters Thesis or Doctoral Dissertation

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

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Thesis, University of Illinois – Chicago. Accessed December 09, 2019. http://hdl.handle.net/10027/20977.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kun, Jeremy J. “Graphs, New Models, and Complexity.” 2016. Web. 09 Dec 2019.

Vancouver:

Kun JJ. Graphs, New Models, and Complexity. [Internet] [Thesis]. University of Illinois – Chicago; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10027/20977.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kun JJ. Graphs, New Models, and Complexity. [Thesis]. University of Illinois – Chicago; 2016. Available from: http://hdl.handle.net/10027/20977

Not specified: Masters Thesis or Doctoral Dissertation

Montana Tech

9. Hooker, Robert Perry. Functional Encryption as Mediated Obfuscation.

Degree: MS, 2012, Montana Tech

URL: https://scholarworks.umt.edu/etd/475

► We introduce a new model for program obfuscation, called mediated obfuscation. A mediated obfuscation is a 3-party protocol for evaluating an obfuscated program that requires…
(more)

Subjects/Keywords: cryptography; functional encryption; obfuscation; theoretical computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Hooker, R. P. (2012). Functional Encryption as Mediated Obfuscation. (Masters Thesis). Montana Tech. Retrieved from https://scholarworks.umt.edu/etd/475

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

Hooker, Robert Perry. “Functional Encryption as Mediated Obfuscation.” 2012. Masters Thesis, Montana Tech. Accessed December 09, 2019. https://scholarworks.umt.edu/etd/475.

MLA Handbook (7^{th} Edition):

Hooker, Robert Perry. “Functional Encryption as Mediated Obfuscation.” 2012. Web. 09 Dec 2019.

Vancouver:

Hooker RP. Functional Encryption as Mediated Obfuscation. [Internet] [Masters thesis]. Montana Tech; 2012. [cited 2019 Dec 09]. Available from: https://scholarworks.umt.edu/etd/475.

Council of Science Editors:

Hooker RP. Functional Encryption as Mediated Obfuscation. [Masters Thesis]. Montana Tech; 2012. Available from: https://scholarworks.umt.edu/etd/475

Cornell University

10. Syrgkanis, Vasileios. Efficiency Of Mechanisms In Complex Markets .

Degree: 2014, Cornell University

URL: http://hdl.handle.net/1813/38938

► We provide a unifying theory for the analysis and design of efficient simple mechanisms for allocating resources to strategic players, with guaranteed good properties even…
(more)

Subjects/Keywords: theoretical computer science; economics; price of anarchy

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Syrgkanis, V. (2014). Efficiency Of Mechanisms In Complex Markets . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/38938

Not specified: Masters Thesis or Doctoral Dissertation

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

Syrgkanis, Vasileios. “Efficiency Of Mechanisms In Complex Markets .” 2014. Thesis, Cornell University. Accessed December 09, 2019. http://hdl.handle.net/1813/38938.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Syrgkanis, Vasileios. “Efficiency Of Mechanisms In Complex Markets .” 2014. Web. 09 Dec 2019.

Vancouver:

Syrgkanis V. Efficiency Of Mechanisms In Complex Markets . [Internet] [Thesis]. Cornell University; 2014. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1813/38938.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Syrgkanis V. Efficiency Of Mechanisms In Complex Markets . [Thesis]. Cornell University; 2014. Available from: http://hdl.handle.net/1813/38938

Not specified: Masters Thesis or Doctoral Dissertation

University of Oxford

11. Blakey, Edward William. A model-independent theory of computational complexity : from patience to precision and beyond.

Degree: PhD, 2010, University of Oxford

URL: http://ora.ox.ac.uk/objects/uuid:5db40e2c-4a22-470d-9283-3b59b99793dc ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540128

► The field of computational complexity theory – which chiefly aims to quantify the difficulty encountered when performing calculations – is, in the case of conventional computers, correctly…
(more)

Subjects/Keywords: 004.01; Computer science (mathematics); theoretical computer science; computational complexity; unconventional computing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Blakey, E. W. (2010). A model-independent theory of computational complexity : from patience to precision and beyond. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:5db40e2c-4a22-470d-9283-3b59b99793dc ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540128

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

Blakey, Edward William. “A model-independent theory of computational complexity : from patience to precision and beyond.” 2010. Doctoral Dissertation, University of Oxford. Accessed December 09, 2019. http://ora.ox.ac.uk/objects/uuid:5db40e2c-4a22-470d-9283-3b59b99793dc ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540128.

MLA Handbook (7^{th} Edition):

Blakey, Edward William. “A model-independent theory of computational complexity : from patience to precision and beyond.” 2010. Web. 09 Dec 2019.

Vancouver:

Blakey EW. A model-independent theory of computational complexity : from patience to precision and beyond. [Internet] [Doctoral dissertation]. University of Oxford; 2010. [cited 2019 Dec 09]. Available from: http://ora.ox.ac.uk/objects/uuid:5db40e2c-4a22-470d-9283-3b59b99793dc ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540128.

Council of Science Editors:

Blakey EW. A model-independent theory of computational complexity : from patience to precision and beyond. [Doctoral Dissertation]. University of Oxford; 2010. Available from: http://ora.ox.ac.uk/objects/uuid:5db40e2c-4a22-470d-9283-3b59b99793dc ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540128

McMaster University

12. Alqarni, Mohammad. Modelling Concurrent Systems with Interval Processes.

Degree: PhD, 2016, McMaster University

URL: http://hdl.handle.net/11375/19007

►

Standard operational semantics of the majority of concurrency models is defined in terms of either sequences or step sequences, while standard concurrent history semantics is… (more)

Subjects/Keywords: Computer Science; Theoretical Computer Sceince; Systems Modelling; Concurrency

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Alqarni, M. (2016). Modelling Concurrent Systems with Interval Processes. (Doctoral Dissertation). McMaster University. Retrieved from http://hdl.handle.net/11375/19007

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

Alqarni, Mohammad. “Modelling Concurrent Systems with Interval Processes.” 2016. Doctoral Dissertation, McMaster University. Accessed December 09, 2019. http://hdl.handle.net/11375/19007.

MLA Handbook (7^{th} Edition):

Alqarni, Mohammad. “Modelling Concurrent Systems with Interval Processes.” 2016. Web. 09 Dec 2019.

Vancouver:

Alqarni M. Modelling Concurrent Systems with Interval Processes. [Internet] [Doctoral dissertation]. McMaster University; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/11375/19007.

Council of Science Editors:

Alqarni M. Modelling Concurrent Systems with Interval Processes. [Doctoral Dissertation]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/19007

KTH

13. Gedin, Emanuel. Hardness of showing hardness of the minimum circuit size problem.

Degree: TCS, 2018, KTH

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232218

►

The problem of finding the smallest size of a circuit that computes a given boolean function, usually referred to as the minimum circuit size… (more)

Subjects/Keywords: computer science; theoretical computer science; complexity theory; minimum circuit size problem; Computer Sciences; Datavetenskap (datalogi)

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gedin, E. (2018). Hardness of showing hardness of the minimum circuit size problem. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232218

Not specified: Masters Thesis or Doctoral Dissertation

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

Gedin, Emanuel. “Hardness of showing hardness of the minimum circuit size problem.” 2018. Thesis, KTH. Accessed December 09, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232218.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gedin, Emanuel. “Hardness of showing hardness of the minimum circuit size problem.” 2018. Web. 09 Dec 2019.

Vancouver:

Gedin E. Hardness of showing hardness of the minimum circuit size problem. [Internet] [Thesis]. KTH; 2018. [cited 2019 Dec 09]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232218.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gedin E. Hardness of showing hardness of the minimum circuit size problem. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-232218

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

14. Dixit, Kashyap. Robust Models For Property Testing.

Degree: PhD, Computer Science and Engineering, 2015, Penn State University

URL: https://etda.libraries.psu.edu/catalog/27153

► Property testing [Rubinfeld Sudan 96,Goldreich Goldwasser Ron 98] is a formal framework for studying approximate sublinear time randomized algorithms for decision problems. These algorithms have…
(more)

Subjects/Keywords: Property Testing; Sublinear Algorithms; Randomized Algorithms; Approximation Algorithms; Theoretical Computer Science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Dixit, K. (2015). Robust Models For Property Testing. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/27153

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

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Doctoral Dissertation, Penn State University. Accessed December 09, 2019. https://etda.libraries.psu.edu/catalog/27153.

MLA Handbook (7^{th} Edition):

Dixit, Kashyap. “Robust Models For Property Testing.” 2015. Web. 09 Dec 2019.

Vancouver:

Dixit K. Robust Models For Property Testing. [Internet] [Doctoral dissertation]. Penn State University; 2015. [cited 2019 Dec 09]. Available from: https://etda.libraries.psu.edu/catalog/27153.

Council of Science Editors:

Dixit K. Robust Models For Property Testing. [Doctoral Dissertation]. Penn State University; 2015. Available from: https://etda.libraries.psu.edu/catalog/27153

University of Cincinnati

15. Khatwani, Charu. Exploring and Explaining Viewpoints Merging.

Degree: MS, Engineering and Applied Science: Computer Science, 2017, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin150479606259188

► Compared to building a single requirements view, modeling stakeholder viewpoints and then merging them is shown to improve the understanding of the problem domain, but…
(more)

Subjects/Keywords: Computer Science; Theoretical replication; Viewpoints; Model merging; Traceability; Case study; ScholarUC

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khatwani, C. (2017). Exploring and Explaining Viewpoints Merging. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin150479606259188

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

Khatwani, Charu. “Exploring and Explaining Viewpoints Merging.” 2017. Masters Thesis, University of Cincinnati. Accessed December 09, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin150479606259188.

MLA Handbook (7^{th} Edition):

Khatwani, Charu. “Exploring and Explaining Viewpoints Merging.” 2017. Web. 09 Dec 2019.

Vancouver:

Khatwani C. Exploring and Explaining Viewpoints Merging. [Internet] [Masters thesis]. University of Cincinnati; 2017. [cited 2019 Dec 09]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin150479606259188.

Council of Science Editors:

Khatwani C. Exploring and Explaining Viewpoints Merging. [Masters Thesis]. University of Cincinnati; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin150479606259188

University of Saskatchewan

16. Liu, Jing. Scrambling analysis of ciliates.

Degree: 2009, University of Saskatchewan

URL: http://hdl.handle.net/10388/etd-09092009-154551

► Ciliates are a class of organisms which undergo a genetic process called gene descrambling after mating. In order to better understand the problem, a literature…
(more)

Subjects/Keywords: theoretical computer science; ciliate scrambling system; scrambling analysis; sequence alignment; bioinformatics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Liu, J. (2009). Scrambling analysis of ciliates. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-09092009-154551

Not specified: Masters Thesis or Doctoral Dissertation

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

Liu, Jing. “Scrambling analysis of ciliates.” 2009. Thesis, University of Saskatchewan. Accessed December 09, 2019. http://hdl.handle.net/10388/etd-09092009-154551.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Liu, Jing. “Scrambling analysis of ciliates.” 2009. Web. 09 Dec 2019.

Vancouver:

Liu J. Scrambling analysis of ciliates. [Internet] [Thesis]. University of Saskatchewan; 2009. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10388/etd-09092009-154551.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu J. Scrambling analysis of ciliates. [Thesis]. University of Saskatchewan; 2009. Available from: http://hdl.handle.net/10388/etd-09092009-154551

Not specified: Masters Thesis or Doctoral Dissertation

Cornell University

17. Minnes, Mor Mia. Computability and Complexity Properties of Automatic Structures and their Applications .

Degree: 2008, Cornell University

URL: http://hdl.handle.net/1813/10820

► Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend themselves well to real-time computations and efficient algorithms. Continuing a…
(more)

Subjects/Keywords: Mathematical Logic; Theoretical Computer Science; Finite automata; Computable model theory

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Minnes, M. M. (2008). Computability and Complexity Properties of Automatic Structures and their Applications . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/10820

Not specified: Masters Thesis or Doctoral Dissertation

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

Minnes, Mor Mia. “Computability and Complexity Properties of Automatic Structures and their Applications .” 2008. Thesis, Cornell University. Accessed December 09, 2019. http://hdl.handle.net/1813/10820.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Minnes, Mor Mia. “Computability and Complexity Properties of Automatic Structures and their Applications .” 2008. Web. 09 Dec 2019.

Vancouver:

Minnes MM. Computability and Complexity Properties of Automatic Structures and their Applications . [Internet] [Thesis]. Cornell University; 2008. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1813/10820.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Minnes MM. Computability and Complexity Properties of Automatic Structures and their Applications . [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/10820

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

18. Nazari, Azin. Majority in the Three-Way Comparison Model.

Degree: 2019, University of Waterloo

URL: http://hdl.handle.net/10012/14970

► In this thesis, we study comparison based problems in a new comparison model called three-way, where a comparison can result in { >, =, <…
(more)

Subjects/Keywords: algorithm; theoretical computer science; comparison-based problems; majority; partition

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Nazari, A. (2019). Majority in the Three-Way Comparison Model. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14970

Not specified: Masters Thesis or Doctoral Dissertation

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

Nazari, Azin. “Majority in the Three-Way Comparison Model.” 2019. Thesis, University of Waterloo. Accessed December 09, 2019. http://hdl.handle.net/10012/14970.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nazari, Azin. “Majority in the Three-Way Comparison Model.” 2019. Web. 09 Dec 2019.

Vancouver:

Nazari A. Majority in the Three-Way Comparison Model. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10012/14970.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nazari A. Majority in the Three-Way Comparison Model. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14970

Not specified: Masters Thesis or Doctoral Dissertation

Northeastern University

19. Jafargholi, Zahra. New proof techniques for adaptive security.

Degree: PhD, Computer Science Program, 2016, Northeastern University

URL: http://hdl.handle.net/2047/D20214470

► Selective security refers to the case where the attacker decides on some parameters of the attack before the attack even begins. In contrast, adaptive security…
(more)

Subjects/Keywords: adaptive security; garbled circuits; multi-party computation; secure computation; theoretical computer science; theoretical cryptography; Data encryption (Computer science); Computer security; Computer networks; Security measures; Computer network protocols; Cryptography

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jafargholi, Z. (2016). New proof techniques for adaptive security. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20214470

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

Jafargholi, Zahra. “New proof techniques for adaptive security.” 2016. Doctoral Dissertation, Northeastern University. Accessed December 09, 2019. http://hdl.handle.net/2047/D20214470.

MLA Handbook (7^{th} Edition):

Jafargholi, Zahra. “New proof techniques for adaptive security.” 2016. Web. 09 Dec 2019.

Vancouver:

Jafargholi Z. New proof techniques for adaptive security. [Internet] [Doctoral dissertation]. Northeastern University; 2016. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2047/D20214470.

Council of Science Editors:

Jafargholi Z. New proof techniques for adaptive security. [Doctoral Dissertation]. Northeastern University; 2016. Available from: http://hdl.handle.net/2047/D20214470

University of Illinois – Chicago

20. Lelkes, Ádám D. Algorithms and Complexity Results for Learning and Big Data.

Degree: 2017, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/21729

► This thesis focuses on problems in the theory and practice of machine learning and big data. We will explore the complexity-theoretic properties of MapReduce, one…
(more)

Subjects/Keywords: theoretical computer science; learning theory; machine learning; big data; complexity theory; mapreduce; clustering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Lelkes, . D. (2017). Algorithms and Complexity Results for Learning and Big Data. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/21729

Not specified: Masters Thesis or Doctoral Dissertation

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

Lelkes, Ádám D. “Algorithms and Complexity Results for Learning and Big Data.” 2017. Thesis, University of Illinois – Chicago. Accessed December 09, 2019. http://hdl.handle.net/10027/21729.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lelkes, Ádám D. “Algorithms and Complexity Results for Learning and Big Data.” 2017. Web. 09 Dec 2019.

Vancouver:

Lelkes D. Algorithms and Complexity Results for Learning and Big Data. [Internet] [Thesis]. University of Illinois – Chicago; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10027/21729.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lelkes D. Algorithms and Complexity Results for Learning and Big Data. [Thesis]. University of Illinois – Chicago; 2017. Available from: http://hdl.handle.net/10027/21729

Not specified: Masters Thesis or Doctoral Dissertation

University of Nottingham

21. Chaplin, Jack Christopher. Computation with photochromic memory.

Degree: 2013, University of Nottingham

URL: http://eprints.nottingham.ac.uk/13850/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588370

► Unconventional computing is an area of research in which novel materials and paradigms are utilised to implement computation and data storage. This includes attempts to…
(more)

Subjects/Keywords: 006.384; QA 75 Electronic computers. Computer science; QD450 Physical and theoretical chemistry

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Chaplin, J. C. (2013). Computation with photochromic memory. (Doctoral Dissertation). University of Nottingham. Retrieved from http://eprints.nottingham.ac.uk/13850/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588370

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

Chaplin, Jack Christopher. “Computation with photochromic memory.” 2013. Doctoral Dissertation, University of Nottingham. Accessed December 09, 2019. http://eprints.nottingham.ac.uk/13850/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588370.

MLA Handbook (7^{th} Edition):

Chaplin, Jack Christopher. “Computation with photochromic memory.” 2013. Web. 09 Dec 2019.

Vancouver:

Chaplin JC. Computation with photochromic memory. [Internet] [Doctoral dissertation]. University of Nottingham; 2013. [cited 2019 Dec 09]. Available from: http://eprints.nottingham.ac.uk/13850/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588370.

Council of Science Editors:

Chaplin JC. Computation with photochromic memory. [Doctoral Dissertation]. University of Nottingham; 2013. Available from: http://eprints.nottingham.ac.uk/13850/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588370

University of California – Irvine

22. Gupta, Siddharth. Topological Algorithms for Geographic and Geometric Graphs.

Degree: Computer Science, 2018, University of California – Irvine

URL: http://www.escholarship.org/uc/item/52t311vn

► We study some geographic and geometric graphs namely road networks and clustered graphs from topological viewpoint, i.e., we consider them as embedded graphs, graphs in…
(more)

Subjects/Keywords: Computer science; Theoretical mathematics; C-Planarity; Cycle Separator; FPT Algorithms; Road Networks

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gupta, S. (2018). Topological Algorithms for Geographic and Geometric Graphs. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/52t311vn

Not specified: Masters Thesis or Doctoral Dissertation

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

Gupta, Siddharth. “Topological Algorithms for Geographic and Geometric Graphs.” 2018. Thesis, University of California – Irvine. Accessed December 09, 2019. http://www.escholarship.org/uc/item/52t311vn.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gupta, Siddharth. “Topological Algorithms for Geographic and Geometric Graphs.” 2018. Web. 09 Dec 2019.

Vancouver:

Gupta S. Topological Algorithms for Geographic and Geometric Graphs. [Internet] [Thesis]. University of California – Irvine; 2018. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/52t311vn.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gupta S. Topological Algorithms for Geographic and Geometric Graphs. [Thesis]. University of California – Irvine; 2018. Available from: http://www.escholarship.org/uc/item/52t311vn

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

23. Gordon, Spencer L. The complexity of continuous local search.

Degree: MS, Computer Science, 2017, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/97391

► The complexity class CLS was introduced by Daskalakis and Papadimitriou in [9] with the goal of capturing the complexity of some well-known problems in PPAD…
(more)

Subjects/Keywords: Theoretical computer science; Algorithmic game theory; Computational complexity; Linear complementarity problem; Contraction map

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Gordon, S. L. (2017). The complexity of continuous local search. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/97391

Not specified: Masters Thesis or Doctoral Dissertation

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

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Thesis, University of Illinois – Urbana-Champaign. Accessed December 09, 2019. http://hdl.handle.net/2142/97391.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gordon, Spencer L. “The complexity of continuous local search.” 2017. Web. 09 Dec 2019.

Vancouver:

Gordon SL. The complexity of continuous local search. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2142/97391.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gordon SL. The complexity of continuous local search. [Thesis]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/97391

Not specified: Masters Thesis or Doctoral Dissertation

24. Mayfield, James L., IV. A Parameterized Framework for Quantum Computation.

Degree: PhD, Engineering and Applied Science: Computer Science and Engineering, 2012, University of Cincinnati

URL: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342543546

► The primary focus of this dissertation is the development of a framework for the design and analysis of quantum circuits and quantum algorithms based…
(more)

Subjects/Keywords: Computer Science; Quantum Computing; Theoretical Computer Science

…*computer* *science*, it did not remain the dominant model of computation in quantum computing… …mechanical systems. Not
long after Feynman planted the seeds for a quantum *computer*, physicist… …computation have been the subject of research in Mathematics, Physics, and Com5
puter *Science* for… …quantum *computer* can, without question, outperform
a classical *computer*. Furthermore, it has… …represent the integer. No known classical algorithm can match the *theoretical*
bounds on Shor’s…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mayfield, James L., I. (2012). A Parameterized Framework for Quantum Computation. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342543546

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

Mayfield, James L., IV. “A Parameterized Framework for Quantum Computation.” 2012. Doctoral Dissertation, University of Cincinnati. Accessed December 09, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342543546.

MLA Handbook (7^{th} Edition):

Mayfield, James L., IV. “A Parameterized Framework for Quantum Computation.” 2012. Web. 09 Dec 2019.

Vancouver:

Mayfield, James L. I. A Parameterized Framework for Quantum Computation. [Internet] [Doctoral dissertation]. University of Cincinnati; 2012. [cited 2019 Dec 09]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342543546.

Council of Science Editors:

Mayfield, James L. I. A Parameterized Framework for Quantum Computation. [Doctoral Dissertation]. University of Cincinnati; 2012. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1342543546

University of Waterloo

25. Harms, Nathaniel. Halfway to Halfspace Testing.

Degree: 2017, University of Waterloo

URL: http://hdl.handle.net/10012/12557

► In this thesis I study the problem of testing halfspaces under arbitrary probability distributions, using only random samples. A halfspace, or linear threshold function, is…
(more)

Subjects/Keywords: property testing; sublinear algorithms; computer science; theoretical computer science; algorithms and complexity; halfspaces; linear threshold functions; machine learning

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harms, N. (2017). Halfway to Halfspace Testing. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12557

Not specified: Masters Thesis or Doctoral Dissertation

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

Harms, Nathaniel. “Halfway to Halfspace Testing.” 2017. Thesis, University of Waterloo. Accessed December 09, 2019. http://hdl.handle.net/10012/12557.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Harms, Nathaniel. “Halfway to Halfspace Testing.” 2017. Web. 09 Dec 2019.

Vancouver:

Harms N. Halfway to Halfspace Testing. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10012/12557.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harms N. Halfway to Halfspace Testing. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12557

Not specified: Masters Thesis or Doctoral Dissertation

26. Jansson, Patrik. Polytypism and polytypic unification .

Degree: Chalmers University of Technology / Department of Computer Science, 1995, Chalmers University of Technology

URL: http://hdl.handle.net/20.500.12380/10118

This report describes what polytypic programming is, a new system for writing polytypic functions, and a number of useful example functions including generalised versions of map, zip and a specific lazy array based unification algorithm.

Subjects/Keywords: Teoretisk datalogi; Datalogi; Theoretical computer science; Computer science

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Jansson, P. (1995). Polytypism and polytypic unification . (Thesis). Chalmers University of Technology. Retrieved from http://hdl.handle.net/20.500.12380/10118

Not specified: Masters Thesis or Doctoral Dissertation

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

Jansson, Patrik. “Polytypism and polytypic unification .” 1995. Thesis, Chalmers University of Technology. Accessed December 09, 2019. http://hdl.handle.net/20.500.12380/10118.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jansson, Patrik. “Polytypism and polytypic unification .” 1995. Web. 09 Dec 2019.

Vancouver:

Jansson P. Polytypism and polytypic unification . [Internet] [Thesis]. Chalmers University of Technology; 1995. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/20.500.12380/10118.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jansson P. Polytypism and polytypic unification . [Thesis]. Chalmers University of Technology; 1995. Available from: http://hdl.handle.net/20.500.12380/10118

Not specified: Masters Thesis or Doctoral Dissertation

UCLA

27. Khurana, Dakshita. How to Rewind with Minimal Interaction.

Degree: Computer Science, 2018, UCLA

URL: http://www.escholarship.org/uc/item/53s2w021

► The notion of simulation is central to cryptography: often, to demonstrate that an adversary did not recover any information about private inputs of other participants,…
(more)

Subjects/Keywords: Computer science; Theoretical mathematics; Computer engineering; black-box; non-interactive; non-malleable commitment; rewinding; two message; zero knowledge

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Khurana, D. (2018). How to Rewind with Minimal Interaction. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/53s2w021

Not specified: Masters Thesis or Doctoral Dissertation

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

Khurana, Dakshita. “How to Rewind with Minimal Interaction.” 2018. Thesis, UCLA. Accessed December 09, 2019. http://www.escholarship.org/uc/item/53s2w021.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Khurana, Dakshita. “How to Rewind with Minimal Interaction.” 2018. Web. 09 Dec 2019.

Vancouver:

Khurana D. How to Rewind with Minimal Interaction. [Internet] [Thesis]. UCLA; 2018. [cited 2019 Dec 09]. Available from: http://www.escholarship.org/uc/item/53s2w021.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khurana D. How to Rewind with Minimal Interaction. [Thesis]. UCLA; 2018. Available from: http://www.escholarship.org/uc/item/53s2w021

Not specified: Masters Thesis or Doctoral Dissertation

28. Ferreira, Fábio Miguel Matos. Aprendizagem na programação: um modelo de continuidade de aprendizagem de programação.

Degree: 2015, RCAAP

URL: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/11485

►

Mestrado em Software de Código Aberto

Existe atualmente uma enorme dificuldade em aprender programação. Neste contexto foi realizada a presente dissertação que com base em… (more)

Subjects/Keywords: Educação; Ensino da programação; Modelo teórico; Intenção; Utilidade; Satisfação; Computer science education; Computer programming education; Theoretical model; Intention; Usefulness; Satisfaction

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ferreira, F. M. M. (2015). Aprendizagem na programação: um modelo de continuidade de aprendizagem de programação. (Thesis). RCAAP. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/11485

Not specified: Masters Thesis or Doctoral Dissertation

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

Ferreira, Fábio Miguel Matos. “Aprendizagem na programação: um modelo de continuidade de aprendizagem de programação.” 2015. Thesis, RCAAP. Accessed December 09, 2019. https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/11485.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ferreira, Fábio Miguel Matos. “Aprendizagem na programação: um modelo de continuidade de aprendizagem de programação.” 2015. Web. 09 Dec 2019.

Vancouver:

Ferreira FMM. Aprendizagem na programação: um modelo de continuidade de aprendizagem de programação. [Internet] [Thesis]. RCAAP; 2015. [cited 2019 Dec 09]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/11485.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ferreira FMM. Aprendizagem na programação: um modelo de continuidade de aprendizagem de programação. [Thesis]. RCAAP; 2015. Available from: https://www.rcaap.pt/detail.jsp?id=oai:repositorio.iscte-iul.pt:10071/11485

Not specified: Masters Thesis or Doctoral Dissertation

Universiteit Utrecht

29. Staals, Frank. Geometric Algorithms for Trajectory Analysis.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/313870

► Technology such as the Global Positing System (GPS) has made tracking moving entities easy and cheap. As a result there is a large amount of…
(more)

Subjects/Keywords: theoretical computer science; computational geometry; geographic information science; geometric algorithms; trajectory; trajectory analysis; movement analysis; collective motion; segmentation; hotspot

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Staals, F. (2015). Geometric Algorithms for Trajectory Analysis. (Doctoral Dissertation). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/313870

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

Staals, Frank. “Geometric Algorithms for Trajectory Analysis.” 2015. Doctoral Dissertation, Universiteit Utrecht. Accessed December 09, 2019. http://dspace.library.uu.nl:8080/handle/1874/313870.

MLA Handbook (7^{th} Edition):

Staals, Frank. “Geometric Algorithms for Trajectory Analysis.” 2015. Web. 09 Dec 2019.

Vancouver:

Staals F. Geometric Algorithms for Trajectory Analysis. [Internet] [Doctoral dissertation]. Universiteit Utrecht; 2015. [cited 2019 Dec 09]. Available from: http://dspace.library.uu.nl:8080/handle/1874/313870.

Council of Science Editors:

Staals F. Geometric Algorithms for Trajectory Analysis. [Doctoral Dissertation]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/313870

30. Giaquinta, Emanuele. Advancements in finite-state methods for string matching.

Degree: 2011, Università degli Studi di Catania

URL: http://hdl.handle.net/10761/186

► This thesis illustrates some advancements in finite-state methods for solving the string-matching problem and some of its variants. Finite-state automata are central building blocks in…
(more)

Subjects/Keywords: Theoretical computer science; String matching; Multiple string matching; Approximate string matching; Compressed string matching; Bit-parallelism

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Giaquinta, E. (2011). Advancements in finite-state methods for string matching. (Thesis). Università degli Studi di Catania. Retrieved from http://hdl.handle.net/10761/186

Not specified: Masters Thesis or Doctoral Dissertation

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

Giaquinta, Emanuele. “Advancements in finite-state methods for string matching.” 2011. Thesis, Università degli Studi di Catania. Accessed December 09, 2019. http://hdl.handle.net/10761/186.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Giaquinta, Emanuele. “Advancements in finite-state methods for string matching.” 2011. Web. 09 Dec 2019.

Vancouver:

Giaquinta E. Advancements in finite-state methods for string matching. [Internet] [Thesis]. Università degli Studi di Catania; 2011. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/10761/186.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Giaquinta E. Advancements in finite-state methods for string matching. [Thesis]. Università degli Studi di Catania; 2011. Available from: http://hdl.handle.net/10761/186

Not specified: Masters Thesis or Doctoral Dissertation