Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 53 for “"theoretical computer science"”.
-
Higher-order Fourier analysis with applications to additive combinatorics and theoretical computer science
… give applications in additive combinatorics and theoretical computer science. We prove an induced arithmetic removal lemma first in complexity 1 and then for patterns of all complexities. This latter result solves a central problem in property testing known as the classification of testable …
-
Graphs, matrices, and populations : linear algebraic techniques in theoretical computer science and population genetics
In this thesis, we present several algorithmic results for problems in spectral graph theory and computational biology. The first part concerns the problem of spectral sparsification. It is known that every dense graph can be approximated in a strong sense by a sparse subgraph, known as a spectral …
-
Computational methods for multi-omic models of cell metabolism and their importance for theoretical computer science
… in this dissertation I focus not only on how computer science can help biologists, but also on how biology can inspire computer scientists. On one hand, computer science provides powerful abstraction tools for metabolic networks. Cell metabolism is the set of chemical reactions taking place in …
-
Modeling and Analysis of the Collective Dynamics of Large-Scale Multi-Agent Systems
… systems, distributed artificial intelligence, theoretical computer science, formal methods, computational complexity, cellular and network automata, agent-based modeling, discrete dynamical systems, complex systems.
-
Topics in combinatorics and algorithms
This thesis studies several topics in theoretical computer science. First, the author shows that $5n-4$ is a tight lower bound on the number of edges in the visibility graph of n non-intersecting line segments in the plane.
-
Tensors, sparse problems and conditional hardness
In this thesis we study the interplay between theoretical computer science and machine learning in three different directions. First, we make a connection between two ubiquitous sparse problems: Sparse Principal Component Analysis (SPCA) and Sparse Linear Regression (SLR). We show how to …
-
Dynamic Programming meets Fine-grained Complexity
… remained one of the most popular technique in theoretical computer science, and has found applications in a wide range of problems. In this thesis, I summarize my three recent works covering applications of DP to three fundamental problems in fine-grained complexity. The first application is a …
-
Designing visually rich mathmatical investing tools for repetitive geometric artifacts
… Euclidean geometry), abstract algebra, theoretical computer science, and human-computer interaction (HCI). Geometry provides examples of rich visual artifacts that have many subtle properties. Abstract algebra provides a means and a framework for understanding and describing the …
-
Diversity-inducing probability measures for machine learning
… several recent breakthroughs in mathematics and theoretical computer science, but their power has not yet been explored for machine learning. In this thesis, we investigate DIPMs, their mathematical properties, sampling algorithms, and applications. Perhaps the best known instance of a DIPM is a …
-
Construction of quasi-metrics determined by orders
… asymmetric structures. Problems arising from theoretical computer science, applied physics and many more areas can easily be expressed in that setting. In the asymmetric framework, many investigations on general topology have been done in order to extend known results of the classical theory. …
-
A new algorithm for the quantified satisfiability problem, based on zero-suppressed binary decision diagrams and memoization
… formulas (QBFs) play an important role in theoretical computer science. QBF extends propositional logic in such a way that many advanced forms of reasoning can be easily formulated and evaluated. In this dissertation we present our ZQSAT, which is an algorithm for evaluating quantified …
-
Efficient algorithms for new computational models
… central thesis that it is an important part of theoretical computer science to model real-world computational structures, and that such effort is richly rewarded by a plethora of interesting and challenging problems.
-
Urml: A textual toolkit for teaching model-driven development for reactive systems
… Models also serve as the founda- tion of theoretical computer science—from computational models to formal languages. However, even though software designers use formal systems of software, a dominant modelling methodology—model-driven development (MDD)—has not yet penetrated into the …
-
Variations of online bipartite matching
… Matching Problem is a well-studied problem in theoretical computer science that models several real-world applications including online investment, kidney transplantation, aviation security passenger screening, and enhanced Ebola entry screening. However, the original version of the problem is …
-
Strategic algorithms
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components are, for example, uncertainty and economic incentives. Therefore, modem …
-
Empirical Analysis of Algorithms for the k-Server and Online Bipartite Matching Problems
… problem is of significant importance to the theoretical computer science and the operations research community. In this problem, we are given k servers, their initial locations and a sequence of n requests that arrive one at a time. All these locations are points from some metric space and …
-
Computational applications of noise sensitivity
… of boolean functions and its applications in theoretical computer science. Noise sensitivity is defined as follows: Let f be a boolean function and let ... be a parameter. Suppose a uniformly random string x is picked, and y is formed by flipping each bit of x independently with probability e. …
-
Enabling decentralized wireless index coding in practice
Index coding is a problem in theoretical computer science and network information theory that studies the optimal coding scheme for transmitting multiple messages across a network to receivers with different side information. The ultimate goal of index coding is to reduce transmission time in a …
-
Analysis of recursive cache-adaptive algorithms
… there has been extensive study of caching in theoretical computer science. The traditionally studied model was the external-memory model [AV88]. In this model cache misses cost O(1) and operations on the CPU are free [AV88]. In 1999 Frigo, Leiserson, Prokop and Ramachandran proposed the …
-
Testing properties of Ising models
… attention in statistics, information theory, and theoretical computer science, with sample-optimal algorithms known in several interesting regimes of parameters [14, 15, 17, 18, 20]. Unfortunately, it has also been understood that these problems become intractable in large dimensions, …
Page 1 of 3