An O(n log n) Unidirectional Algorithm for the Circular Extrema Problem
No abstract available.
Related papers
- A Generalized Theory of Bit Vector Data Flow Analysis TOPLAS 1994
- A Worst Case of Circularity Test Algorithms for Attribute Grammars TOPLAS 1995
- A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms TOPLAS 1990
- Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis POPL 1989
- An Elimination Algorithm for Bidirectional Data Flow Problems Using Edge Placement TOPLAS 1993
- A linear-time algorithm for optimal barrier placement PPoPP 2005
- Incremental Evaluation for a General Class of Circular Attribute Grammars PLDI 1988
- Synbit: synthesizing bidirectional programs using unidirectional sketches OOPSLA 2021