2 search results - page 1 / 1 » Generating Balanced Parentheses and Binary Trees by Prefix S... |
CATS
2008
13 years 6 months ago
2008
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to pro...