#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1999

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Kevin C. Zatloukal, Nicholas J. A. Harvey
- SODA
- 2004

We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data structures should ideally have low congestion. We present a novel randomized data structure, called a <i>family tree</i>, to solve this problem. A family tree has optimal expected… (More)

- Kevin C. Zatloukal, Mary Holland Johnson, Richard E. Ladner
- Data Structures, Near Neighbor Searches, and…
- 1999

- H. Muller, K. Zatloukal, M. Streit, D. Schmalstieg
- 2008 Fifth International Conference BioMedical…
- 2008

This paper describes an interactive data exploration system for molecular and clinical data in the field of personalized medicine. It addresses the essential but to date unsolved problem of how to identify connections between genetic variants and their corresponding diseases or the response to certain drugs and treatments, respectively. It is therefore… (More)

We propose the post-order heap, a new data structure for implementing priority queues. Our structure is a simple variant of the binary heap that requires only Θ(1) amortized time for Insert operations and O(log n) time in the worst case for Delete-Min operations. Like the binary heap, the post-order heap is an implicit data structure, meaning that a… (More)

- Kevin C. Zatloukal
- TQC
- 2013

While efficient algorithms are known for solving many important problems related to groups, no efficient algorithm is known for determining whether two arbitrary groups are isomorphic. The particular case of 2-nilpotent groups, a special type of central extension, is widely believed to contain the essential hard cases. However, looking specifically at… (More)

- Juan Bermejo-Vega, Kevin C. Zatloukal
- ArXiv
- 2015

Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of physical particles), we develop a stabilizer formalism using abelian hypergroups and an associated classical simulation theorem (a la Gottesman-Knill). Using these tools, we… (More)

- Kevin Zatloukal
- 2010

• Topic is lower bounds for data structures problems. What is a data structures problem? – We want to compute a sequence of functions f i where f i 's are from a fixed set Ops. – Most importantly, only x i is explicitly passed to the i-th function. The algorithm must store x 1 ,. .. , x i−1 (or some functions thereof) in memory so it can access them when… (More)

- ‹
- 1
- ›