Login / Signup

Deciding Robustness against Total Store Ordering.

Ahmed BouajjaniRoland MeyerEike Möhlmann
Published in: ICALP (2) (2011)
Keyphrases
  • partial order
  • databases
  • search algorithm
  • lower bound
  • database
  • neural network
  • multiscale
  • data structure
  • computational complexity
  • scheduling problem
  • high robustness
  • knuth bendix