The following pages link to Philipp Woelfel (Q487007):
Displaying 50 items.
- Explicit and efficient hash families suffice for cuckoo hashing with a stash (Q487008) (← links)
- Precision, local search and unimodal functions (Q633830) (← links)
- Randomized mutual exclusion with sub-logarithmic RMR-complexity (Q661045) (← links)
- Fully-adaptive algorithms for long-lived renaming (Q661054) (← links)
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs (Q860816) (← links)
- Representation of graphs by OBDDs (Q1003666) (← links)
- Wait-freedom is harder than lock-freedom under strong linearizability (Q1664128) (← links)
- RMR-efficient implementations of comparison primitives using read and write operations (Q1938362) (← links)
- Efficient randomized test-and-set implementations (Q2010613) (← links)
- Space lower bounds for the signal detection problem (Q2048203) (← links)
- Symbolic topological sorting with OBDDs (Q2465997) (← links)
- New results on the complexity of the middle bit of multiplication (Q2474204) (← links)
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication (Q2508966) (← links)
- Bounds on the OBDD-size of integer multiplication via universal hashing (Q2575837) (← links)
- A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications (Q2581005) (← links)
- (Q2762533) (← links)
- Trading Fences with RMRs and Separating Memory Models (Q2796254) (← links)
- On the Time and Space Complexity of ABA Prevention and Detection (Q2796257) (← links)
- Independence of Tabulation-Based Hash Classes (Q2894493) (← links)
- (Q2904772) (← links)
- On the time and space complexity of randomized test-and-set (Q2933773) (← links)
- Strongly linearizable implementations (Q2933816) (← links)
- Test-and-Set in Optimal Space (Q2941557) (← links)
- The space complexity of long-lived and one-shot timestamp implementations (Q2943392) (← links)
- Making objects writable (Q2943638) (← links)
- (Q3002822) (← links)
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions (Q3304136) (← links)
- Fully-Adaptive Algorithms for Long-Lived Renaming (Q3524322) (← links)
- (Q3549704) (← links)
- Almost random graphs with simple hash functions (Q3581260) (← links)
- Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions (Q3581269) (← links)
- Asymmetric balanced allocation with simple hash functions (Q3581541) (← links)
- Maintaining External Memory Efficient Hash Tables (Q3595377) (← links)
- Computing and Combinatorics (Q4681209) (← links)
- (Q4708564) (← links)
- (Q4736860) (← links)
- Efficient Fetch-and-Increment (Q4909399) (← links)
- RMR-Efficient Randomized Abortable Mutual Exclusion (Q4909417) (← links)
- Tight bounds for blind search on the integers (Q4910723) (← links)
- Tight Bounds for Blind Search on the Integers and the Reals (Q4911109) (← links)
- (Q4941908) (← links)
- (Q5090474) (← links)
- Allocate-On-Use Space Complexity of Shared-Memory Algorithms (Q5090897) (← links)
- (Q5090913) (← links)
- Towards a Theory of Randomized Shared Memory Algorithms (Q5145195) (← links)
- Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion (Q5145196) (← links)
- Strongly Linearizable Implementations of Snapshots and Other Types (Q5145201) (← links)
- Randomized mutual exclusion in O(log N / log log N) RMRs (Q5170298) (← links)
- Tight lower bounds for greedy routing in uniform small world rings (Q5172754) (← links)
- A read-once branching program lower bound of Ω(2 <sup>n/4</sup> ) for integer multiplication using universal hashing (Q5175997) (← links)
