#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hs, Prof R Wattenhofer, S Brandt, P Khanchandani, D Melnyk, T Ulrich
- 2016

The competitive analysis of an algorithm Alg consists of two separate steps. First, we show that for an arbitrary problem instance, the result of Alg is asymptotically at most a factor r worse than the the optimal offline result. This yields an upper bound on Alg’s result, that is costAlg ≤ r · costOpt + c. If the task is to show that Alg is… (More)

- Felix Schuhknecht, Pankaj Khanchandani, Jens Dittrich
- PVLDB
- 2015

Figure 1: Original version In its most primitive form, coined original version from here on, it partitions a dataset into 2 (where R ≤ 32) partitions as shown in Figure 1: in the first pass over the data, we count for each partition the number of entries that will be sent to it (lines 1-2). From this generated histogram, we calculate the start index of each… (More)

- Pankaj Khanchandani, Christoph Lenzen
- SSS
- 2016

We revisit the approach to Byzantine fault-tolerant clock synchronization based on approximate agreement introduced by Lynch and Welch. Our contribution is threefold: • We provide a slightly refined variant of the algorithm yielding improved bounds on the skew that can be achieved and the sustainable frequency offsets. • We show how to extend the technique… (More)

- Pankaj Khanchandani, Roger Wattenhofer
- PODC
- 2017

- Pankaj Khanchandani, Roger Wattenhofer
- OPODIS
- 2016

Consider a complete bipartite graph of 2n nodes with n nodes on each side. In a round, each node can either send at most one message to a neighbor or receive at most one message from a neighbor. Each node has a preference list that ranks all its neighbors in a strict order from 1 to n. We introduce a non-negative similarity parameter ∆ < n for the… (More)

- ‹
- 1
- ›