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 186 for “"theoretical computer science"”.
-
Some results in probability and theoretical computer science
<p>As typical examples for nonlinear dynamical systems, the logistic maps mapping x to cx(1 - x) with x is in [0,1] and c is a constant in [0,4] have been extensively studied. Bhattacharya and Rao (1993) studied the case that c is a random variable rather than a constant. In this case, each of the …
-
INFORMATION THEORETIC AND ALGEBRAIC TECHNIQUES IN THEORETICAL COMPUTER SCIENCE
This thesis can be divided into four independent parts. 1.We give a one-round entanglement assisted quantum compression protocol that allows Alice and Bob (players) to sample from a common distribution known only to Alice. We also provide a quantum analogue of the widely used classical …
-
Computational Meta-Theory in Cognitive Science: A Theoretical Computer Science Framework
Cognitive science is a multidisciplinary effort to create knowledge about cognitive systems. As such, it is scoped and limited (and potentially compromised) by assumptions held by cognitive scientists about knowledge-creating processes. In particular, assumptions about the computational properties …
-
Geometric and Combinatorial Problems of Matching and Partitioning in Theoretical Computer Science
In this thesis, we consider four problems in theoretical Computer Science: 1.Disjoint Unit Disks in the plane and disjoint unit balls in space can be separated by hyperplanes. Doing his, we try to minimize the number of intersections between the hyperplane and the balls. Although the first papers …
-
On Connections Between Machine Learning And Information Elicitation, Choice Modeling, And Theoretical Computer Science
… which has its origins at the intersection of computer science and statistics, is now a rapidly growing area of research that is being integrated into almost every discipline in science and business such as economics, marketing and information retrieval. As a consequence of this integration, it …
-
A Hypergraph Regularity Method for Linear Hypergraphs
… Graph Theory, Combinatorial Number Theory and Theoretical Computer Science. Strong hypergraph extensions of graph regularity techniques were recently given by Nagle, Rödl, Schacht and Skokan, by W.T. Gowers, and subsequently, by T. Tao. These extensions have yielded quite a few non-trivial …
-
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.
-
A Survey of Monge Properties
Monge properties play an important role in theoretical computer science. Many greedy algorithms are based on such properties, as is speedup in dynamic programming. Monge properties are simple monotonicity properties which are observed and used in various settings such as resource optimization, …
-
Probabilistic testing of Boolean functions, or, How to test locally for a global property
… as direct applications to important concepts in theoretical computer science, such as probabilistically checkable proofs (PCP). We consider specifically the testing of Boolean functions, discussing some key existing results and providing new results for several classes of functions. In …
-
Non-symmetric completion as a topological foundation for denotational semantics, the complexity analysis of programs, and Russell-Wiener' s theory of continuous-time
… processes at the intersection of mathematics and theoretical computer science,aimed at making explicit limits,convergences, and structures that remain implicit in asymmetric and continuous settings. It begins with the introduction and construction of the U-completion for quasi-uniformspaces, based …
-
Contests: equilibrium analysis, design and learning
… among Bitcoin miners. Using tools from theoretical computer science, we contribute to the understanding of the agents' behavior in contests and make design recommendations to optimize practical objectives. In particular, we (i) analyze learning dynamics in Tullock contests using tools …
-
Randomness and complexity in random complex quantum systems
… from emerging technologies such as quantum computers to the physics of black holes. While tools from quantum information theory can help to answer questions in theoretical computer science, conversely, the ideas developed for analyzing the power of classical computers can shed light on …
-
Effizientes Verifizieren co-NP-vollständiger Probleme am Beispiel zufälliger 4-SAT-Formeln und uniformer Hypergraphen
… is satisfiable - is of fundamental importance in theoretical computer science. In this dissertation we study random 4-SAT formulas with > 116 n^2 clauses. These formulas are almost surly unsatisfiable. Here we show the existence of a polynomial time algorithm that certifies the unsatisfiability. …
-
Cloud storage and online bin packing
… (such as Mozy and Carbonite) to store and backup computer files. We study the problem of allocating memory of servers in a data center based on online requests for storage. Over-the-net data backup has become increasingly easy and cheap due to cloud storage. Given an online sequence of storage …
-
Computational applications of invariance principles
… analysis such as limit theorems to problems in theoretical computer science, specifically to pseudorandomness and learning theory. At first look, limit theorems, pseudorandomness and learning theory appear to be disparate subjects. However, as it has now become apparent, there's a strong …
-
Brauer-Picard groups and pointed braided tensor categories
… physics (conformal field theory) and theoretical computer science (quantum computation). The study of tensor categories is, thus, a useful undertaking. Two classes of tensor categories arise naturally in this study. One consists of group-graded extensions and another of pointed tensor …
-
Amidakuji: Gray Code Algorithms for Listing Ladder Lotteries
… Ladder lotteries are of interest to the field of theoretical computer science because of their relationship with other mathematical objects such as primitive sorting networks. To list ladder lotteries, we define a function that calculates the location for any bar in the data structure in $O(1)$ …
-
Evaluation of Symmetric Functions and Boolean Functions over Stochastic Input
… we focus on problems that can be found in both theoretical computer science and discrete mathematics. The primary goal is to develop approximation algorithms with guaranteed worst-case performance. These algorithms aim to minimize the expected cost of acquiring information necessary for …
-
Runtime estimation of backtracking satisfiability solvers: a machine learning approach
… Problem (SAT) is a prominent problem in theoretical computer science. While there is currently no known worst case polynomial bound for it, in practice, many computations terminate quickly. However, the runtime variance is large. In recent years, satisfiability solvers have advanced to …
Page 1 of 10