A memory efficient reachability data structure through bit vector compression

Eitemau Tebyg

• A memory efficient reachability data structure through bit vector compression.
  gan: Schaik, S, et al.
  Cyhoeddwyd: (2011)
• Vector reachability problem in SL (2, ℤ)
  gan: Potapov, I, et al.
  Cyhoeddwyd: (2016)
• Efficient index structures for reachability and shortest path queries
  gan: Wang, Sibo
  Cyhoeddwyd: (2016)
• Vector and scalar reachability problems in SL(2, Z)
  gan: Potapov, I, et al.
  Cyhoeddwyd: (2018)
• Efficient Memory Shadowing for 64-bit Architectures
  gan: Zhao, Qin, et al.
  Cyhoeddwyd: (2011)