-
Pushkar S. Joglekar
(The Institute of Mathematical Sciences, 2012)
This thesis explores the computation complexity of some algebraic problems
in the commutative and the noncommutative setting. Motivation is to better understand the algorithmic questions in both the settings and to see ...
-
Meenakshi, B.
(, 2009-09-10)
This thesis is concerned with the use of formal methods towards automatic verification of distributed message passing systems with a fixed finite number of agents. Main concentration is on developing logics to reason about ...
-
Sreejith, A.V.
(The Institute of Mathematical Sciences, 2014)
In this thesis, we study logic on words extended with regular quantifiers. Modulo counting quantifiers are one particular example of such quantifiers, which have been well studied in the past. These quantifiers can be ...
-
Sanjukta Roy
(The Institute of Mathematical Sciences, 2020)
-
Das, Bireswar
(The Institute of Mathematical Sciences, 2010)
The complexity of graph isomorphism problem for restricted classes of graphs are studied and the complexity of group theoretic problems related graph isomorphism are investigated. Several problems closely related to the ...
-
Anup Basil Mathew
(The Institute of Mathematical Sciences, 2017)
In this thesis we study the distributed synthesis problem, which asks for an algorithm that synthesizes distributed systems from a given specification. We study this via the equivalent problem of determining the winning ...
-
Gaurav Rattan
(The Institute of Mathematical Sciences, 2016)
-
Prafullkumar Prabhakar Tale
(The Institute of Mathematical Sciences, 2020)
For a family of graphs F , the F -E DITING problem takes as an input a graph G and an
integer k, and the objective is to decide if at most k edit operations on G can result in a
graph that belongs to F . Various graph ...
-
Sankar Deep Chakraborty
(The Institute of Mathematical Sciences, 2018)
Due to the rapid growth of data, algorithms that utilize the space efficiently are increasingly becoming important. This thesis focusses on an emerging area of designing
algorithms for fundamental graph problems using ...
-
Gaurav Sood
(The Institute of Mathematical Sciences, 2023)
In this thesis, we study the proof complexity of two proof systems: (i) Merge
Resolution proof system for Quantified Boolean Formulas (QBFs), and (ii) MaxSAT
Resolution proof system for certifying unsatisfiability
-
Raghavendra Rao, B. V.
(The Institute of Mathematical Sciences, 2010)
This thesis is broadly divided into two parts: i) Study of width bounded arithmetic circuits, and ii) Computational complexity of matroid isomorphism problems. Various arithmetizations of boolean complexity class NC1 is ...
-
Srinivasa Rao, S.
(2009-09-01)
This thesis aims to develop space efficient structures for some of the most fundamental problems in the area of data structures. The design of data structures that use almost optimal space while supporting the operations ...
-
Sheerazuddin, S
(The Institute of Mathematical Sciences, 2013)
The Client-server model of computing is a distributed application structure that
partitions tasks or workloads between service providers, called servers, and service requesters, called clients. In this thesis, the formal ...