Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
10.1007/978-1-84628-970-5 | ||||
Proceedings of Computing: The Australasian Theory Symposium (CATS’09) | 2009 | |||
Nondeterministic Space is Closed under Complementation | SIAM Journal on Computing |
| 208 | 1988 |
ReachFewL = ReachUL | computational complexity |
| 2 | 2012 |
Storing a Sparse Table with 0 (1) Worst Case Access Time | Journal of the ACM |
| 235 | 1984 |