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 67 for “"graph algorithms"”.
-
Functional programming and graph algorithms
This thesis is an investigation of graph algorithms in the non-strict purely functional language Haskell. Emphasis is placed on the importance of achieving an asymptotic complexity as good as with conventional languages. This is achieved by using the monadic model for including actions on the …
-
Problems in Sorting and Graph Algorithms
… problem concerns the determination of optimal algorithms with respect to a new model for evaluating sorting algorithms. We did an exhaustive search for such algorithms. The second problem concerns a conjecture that every sorting algorithm on some input involves every key in O(log n) …
-
Synchronization-avoiding graph algorithms and runtime aspects
… in the programming practice because it makes algorithms easier to design and implement. However, irregular applications such as graph algorithms can suffer performance bottlenecks due to the straggler effect induced by global and vertex-centric barriers. In the effort to eliminate barriers, we …
-
On Deniable Computation and Sublinear Graph Algorithms
… studies deniable computation and sublinear time graph algorithms. Deniable Computation. We define and construct Deniable Fully Homomorphic Encryption based on the Learning With Errors (LWE) polynomial hardness assumption. Deniable FHE enables storing encrypted data in the cloud to be processed …
-
Studies in Graph Algorithms: Generation and Labeling Problems
Made available in DSpace on 2014-12-13T18:02:13Z (GMT). No. of bitstreams: 1 8009222.pdf: 3945619 bytes, checksum: 6f4226ebca57b223412ed96d6d41d404 (MD5) Previous issue date: 1979
-
Topics in computational learning theory and graph algorithms
… class. Thus the existence of randomized Occam algorithms exactly characterizes PAC-learnability for all concept classes with this property. This reveals a close relationship between PAC-learning and information compression for a wide range of interesting classes."
-
Efficient graph algorithms for sequential and parallel computers
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.
-
Parallel Batch-Dynamic Graph Algorithms: Coreness Decomposition and Spanners
… the burgeoning field of batch-dynamic parallel algorithms by presenting parallel batch-dynamic graph algorithms for coreness decomposition and spanners, as well as a number of other related problems. The first class of problems we consider involves approximating coreness decomposition and …
-
Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
… technique to building fully-dynamic randomized graph algorithms. We present the following results: \begin{enumerate} \item A randomized algorithm to estimate the size of a cut in an undirected graph $G = (V, E)$ where $V$ is the set of nodes and $E$ is the set of edges and $n = |V|$ and $m = …
-
Scalable and Efficient Graph Algorithms and Analysis Techniques for Modern Machines
… vertices, call for scalable, fast, and efficient graph algorithms. Luckily, commercial multi-core, multi-processor, and multi-machine environments can handle such volumes of data. Unfortunately, despite the availability of such resources, many current graph algorithms do not take full advantage of …
-
From graphs to matrices, and back : new techniques for graph algorithms
… solve fundamental optimization problems if our algorithms have to run really quickly? The motivation for the research presented in this thesis stems from addressing the above question in the context of algorithmic graph theory. To pursue this direction, we develop a toolkit that combines a …
-
Synthesis of Clock Trees with Useful Skew based on Sparse-Graph Algorithms
Computer-aided design (CAD) for very large scale integration (VLSI) involves
-
Improved distributed algorithms for fundamental graph problems
Distributed graph algorithms provide efficient and theoretically sound methods for solving graph problems in distributed settings and more generally for performing distributed computation in networks. These algorithms are applicable in a wide variety of settings, ranging from computer networks to …
-
Cache and NUMA optimizations in a domain-specific language for graph processing
High-performance graph processing is challenging because the sizes and structures of real-world graphs can vary widely. Graph algorithms also have distinct performance characteristics that lead to different performance bottlenecks. Even though memory technologies such as CPU cache and non-uniform …
-
GPU-Optimized Graph Theory Analysis of Allosteric Protein Signaling Networks
Graph algorithms have been widely applied to science and engineering problems, but the practical applications of graph algorithms to every-growing, large data sets requires significant computational time, motivating the need for efficient, parallel solutions on modern computing architectures. Here, …
-
New directions in sublinear algorithms and testing properties of distributions
This thesis deals with sublinear algorithms for various types of problems in statistics, combinatorial optimization and graph algorithms. A first focus of this thesis is algorithms for testing whether a probability distribution, to which the algorithms have sample access, is equal to a given …
-
Graph diffusions and matrix functions: fast algorithms and localization results
… tools for addressing fundamental applications in graphs such as webpage ranking, protein-function prediction, and product categorization and recommendation. As real-world networks grow to have millions of nodes and billions of edges, the scalability of network analysis algorithms becomes …
-
Convergence speed in distributed consensus and averaging
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology …
Page 1 of 4