Pages that link to "Item:Q1147515"
From MaRDI portal
The following pages link to The space complexity of pebble games on trees (Q1147515):
Displaying 5 items.
- Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
- White pebbles help (Q1111025) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees (Q3951561) (← links)
