activity
20152021
most citedOn the Query Complexity of Black-Peg AB-Mastermind

2 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.DS2017★ 1 cited

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM

Christian Glazik, Jan Schiemann, Anand Srivastav

We study the problem of finding an Euler tour in an undirected graph G in the W-Streaming model with O(n polylog(n)) RAM, where n resp. m is the number of nodes resp. edges of G. O…