Search
Now showing items 31-40 of 72
Improving the Precision of a Scalable Demand-Driven Null- Dereference Verification for Java
(2018-03-19)
The problem addressed in this thesis is sound, scalable, demand-driven null-dereference verification for Java programs via over-approximated weakest preconditions analysis. The base version of this analysis having been ...
Parameterized Complexity of Maximum Edge Coloring in Graphs
(2018-03-09)
The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ...
An Optimizing Code Generator for a Class of Lattice-Boltzmann Computations
(2018-03-09)
Lattice-Boltzmann method(LBM), a promising new particle-based simulation technique for complex and multiscale fluid flows, has seen tremendous adoption in recent years in computational fluid dynamics. Even with a ...
Optimization Algorithms for Deterministic, Stochastic and Reinforcement Learning Settings
(2018-05-30)
Optimization is a very important field with diverse applications in physical, social and biological sciences and in various areas of engineering. It appears widely in ma-chine learning, information retrieval, regression, ...
Incentive Design for Crowdfunding and Crowdsourcing Markets
(2018-05-23)
With the ever-increasing trend in the number of social interactions getting intermediated by technology (the world wide web) as the backdrop, this thesis focuses on the design of mechanisms for online communities (crowds) ...
A Refinement-Based Methodology for Verifying Abstract Data Type Implementations
(2018-06-21)
This thesis is about techniques for proving the functional correctness of Abstract Data Type (ADT) implementations. We provide a framework for proving the functional correctness of imperative language implementations of ...
Fast Actively Secure OT Extension for Short Secrets
(2018-05-25)
Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems ...
An Improved Lower Bound for Depth four Arithmetic Circuits
(2018-05-29)
We study the problem of proving lower bounds for depth four arithmetic circuits. Depth four circuits have been receiving much attraction when it comes to recent circuit lower bound results, as a result of the series of ...
Large Scale Graph Processing in a Distributed Environment
(2018-05-25)
Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multi-core processors and accelerators. However, real world graphs are massive in ...
Improving Last-Level Cache Performance in Single and Multi-Core Processsors
(2018-04-23)
With off-chip memory access taking 100's of processor cycles, getting data to the processor in a timely fashion remains one of the key performance bottlenecks in current systems. With increasing core counts, this problem ...