#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1990

2017

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

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Philipp Woelfel
- MFCS
- 2003

We present a symbolic OBDD algorithm for topological sorting which requires O(log N) OBDD operations. Then we analyze its true runtime for the directed grid graph and show an upper bound of O(log N). This is the first true runtime analysis of a symbolic OBDD algorithm for a fundamental graph problem, and it demonstrates that one can hope that the algorithm… (More)

- Hagit Attiya, Danny Hendler, Philipp Woelfel
- PODC
- 2008

We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call <i>order encoding</i>. By applying information-theoretic arguments, we prove that every order… (More)

- Martin Dietzfelbinger, Philipp Woelfel
- STOC
- 2003

We describe a simple randomized construction for generating pairs of hash functions <i>h<inf>1</inf>,h<inf>2</inf></i> from a universe U to ranges V = [m] = (0,1,...,m-1) and W = [m] so that for every key set S ⊆ U with n = |S| ≤ m/(1 + ε) the (random) bipartite (multi)graph with node set V ∪ W and edge set… (More)

- Alex Brodsky, Faith Ellen, Philipp Woelfel
- Distributed Computing
- 2006

Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names. This paper presents two long-lived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations. The first algorithm is asynchronous, uses… (More)

- George Giakkoupis, Philipp Woelfel
- PODC
- 2012

We study the time and space complexity of randomized Test-And-Set (TAS) implementations from atomic read/write registers in asynchronous shared memory models with <i>n</i> processes. We present an adaptive TAS algorithm with an expected (individual) step complexity of <i>O</i>(log<sup>*</sup> <i>k</i>), for contention <i>k</i>, against the oblivious… (More)

- Martin Dietzfelbinger, Philipp Woelfel
- STOC
- 2009

We consider augmented ring-based networks with vertices 0,...,n-1, where each vertex is connected to its left and right neighbor and possibly to some further vertices (called long range contacts). The outgoing edges of a vertex v are obtained by choosing a subset D of {1,2,...n-1}, with 1, n-1 in D, at random according to a probability distribution mu on… (More)

- Robin Nunkesser, Philipp Woelfel
- ISAAC
- 2005

In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval graphs, interval graphs and bipartite graphs are investigated. Upper and lower bounds are proven for all these graph classes and it is shown that in most (but not all) cases a representation… (More)

- Danny Hendler, Philipp Woelfel
- PODC
- 2009

<i>Mutual exclusion</i> is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on <i>local-spin</i> algorithms and uses the <i>remote memory references</i> (RMRs) metric. A recent proof [9] established an Ω(log <i>N</i>) lower bound on the number of RMRs incurred by processes as they enter and exit the… (More)

- Philipp Woelfel
- SODA
- 2006

We show that for the asymmetric sequential allocation scheme of Vöcking (2003) one can use very simple hash functions. The hash functions we use are a straightforward extension of the hash functions introduced by Dietzfelbinger and Woelfel (2003). In order to evaluate a hash function a few arithmetic operations and table lookups suffice. Moreover, we… (More)

- Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
- Combinatorics, Probability & Computing
- 2010

1Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, 98684 Ilmenau, Germany (e-mail: martin.dietzfelbinger@tu-ilmenau.de) 2School of Computer Science, University of Birmingham, Birmingham B15 2TT, UK (email: J.E.Rowe@cs.bham.ac.uk) 3Fakultät für Informatik, Technische Universität Dortmund, 44221 Dortmund, Germany 4Department of… (More)