Contention-Free Complexity of Shared Memory Algorithms - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Rajeev Alur, Gadi Taubenfeld. Contention-Free Complexity of Shared Memory Algorithms. Inf. Comput., 126(1):62-73, 1996.

@article{AlurT96:0,
  title = {Contention-Free Complexity of Shared Memory Algorithms},
  author = {Rajeev Alur and Gadi Taubenfeld},
  year = {1996},
  researchr = {https://researchr.org/publication/AlurT96%3A0},
  cites = {0},
  citedby = {0},
  journal = {Inf. Comput.},
  volume = {126},
  number = {1},
  pages = {62-73},
}

runs on WebDSL