Phas-structure productions in PL/I: Phas-structure productions in PL/I0
Communications of the ACM
What the Compiler Should Tell the User
Compiler Construction, An Advanced Course, 2nd ed.
A comparison of labeling schemes for ancestor queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Watermelon uniform random generation with applications
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Generating random binary trees - A survey
Information Sciences: an International Journal
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
Efficient Algorithms for Games Played on Trees with Back-edges
Fundamenta Informaticae
Boys-and-girls Birthdays and Hadamard Products
Fundamenta Informaticae - Lattice Path Combinatorics and Applications
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
ACM Transactions on Computation Theory (TOCT)
Solving infinite games on trees with back-edges
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 0.00 |
The empirical testing of error repair schemes for skeletons of source programs in a block-structured language leads to the problem of generating balanced parenthesis strings in a uniform random manner. An efficient generator which works from left to right must compute the correct probability for the next symbol at each stage of the generation. The associated enumeration problem may be solved by adopting a geometric interpretation usually associated with random walk problems. This solution leads immediately to an O(n) algorithm for the generator.