The following pages link to Philipp Woelfel (Q487007):
Displaying 16 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)
- Tight bounds for blind search on the integers (Q4910723) (← links)
- (Q5090474) (← links)
- Allocate-On-Use Space Complexity of Shared-Memory Algorithms (Q5090897) (← links)
- (Q5090913) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431355) (← links)
- (Q6128598) (← links)
