#### Filter Results:

- Full text PDF available (58)

#### Publication Year

2003

2017

- This year (3)
- Last 5 years (36)
- Last 10 years (70)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Jyothish Soman, Kishore Kothapalli, P. J. Narayanan
- 2010 IEEE International Symposium on Parallel…
- 2010

Graphics processing units provide a large computational power at a very low price which position them as an ubiquitous accelerator. General purpose programming on the graphics processing units (GPGPU) is best suited for regular data parallel algorithms. They are not directly amenable for algorithms which have irregular data access patterns such as list… (More)

We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color. It is trivial to see that every graph of maximum degree ∆ can be colored with ∆+1 colors, and distributed algorithms that find a (∆+1)coloring in a logarithmic number of communication rounds, with high… (More)

An important problem for wireless ad hoc networks has been todesign overlay networks that allow time- and energy-efficientrouting. Many local-control strategies for maintaining such overlaynetworks have already been suggested, but most of them are based onan oversimplified wireless communication model.
In this paper, we suggest a model that is much more… (More)

An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted a(G), is the minimum number of colors required for acyclic vertex coloring of graph G = (V,E). For a family F of graphs, the acyclic chromatic number of F , denoted by a(F), is defined as the maximum a(G)… (More)

General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest performance per dollar. The GPUs have been used extensively on regular problems that can be easily parallelized. In this paper, we describe two implementations of List Ranking, a… (More)

- Kishore Kothapalli, Christian Scheideler
- SPAA
- 2003

In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adversarial control. Routing packets to a single destination is also known as information gathering. Information gathering is an important communication primitive for sensor networks.… (More)

The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for these systems. While a large collection of scalable peer-to-peer overlay networks has been proposed in recent years, many fundamental questions have remained open. Some of these are:… (More)

- Kishore Kothapalli, Christian Scheideler, Melih Onus, Christian Schindelhauer
- Proceedings 20th IEEE International Parallel…
- 2006

We consider the well-known vertex coloring problem: given a graph G, find a coloring of the vertices so that no two neighbors in G have the same color. It is trivial to see that every graph of maximum degree Delta can be colored with Delta + 1 colors, and distributed algorithms that find a (Delta + 1)-coloring in a logarithmic number of communication… (More)

- Dip Sankar Banerjee, Shashank Sharma, Kishore Kothapalli
- 20th Annual International Conference on High…
- 2013

Graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components of a graph, and computing shortest paths. There are several efficient implementations of the above problems on a variety of modern multiprocessor architectures. It can be noticed in recent times that… (More)

- Srikanth Srungarapu, Durga Prasad Reddy, Kishore Kothapalli, P. J. Narayanan
- 2011 IEEE Workshops of International Conference…
- 2011

General purpose programming on the graphics processing units(GPGPU) has received a lot of attention in the parallel computing community as it promises to offer a large computational power at a very low price. GPGPU is best suited for regular data parallel algorithms. They are not directly amenable for algorithms which have irregular data access patterns… (More)