No photo of Nir Shavit

View Scopus Profile

Nir Shavit

Professor

Former affiliation
1986 …2023

Research activity per year

Filter
Paper

Search results

  • 2022

    CONNECTOME-CONSTRAINED LATENT VARIABLE MODELS OF WHOLE-BRAIN NEURAL ACTIVITY

    Mi, L., Xu, R., Prakhya, S., Lin, A., Shavit, N., Samuel, A. D. T. & Turaga, S. C., 2022.

    Research output: Contribution to conference › Paper › peer-review

    1 Scopus citations
  • 2020

    A CONSTRUCTIVE PREDICTION OF THE GENERALIZATION ERROR ACROSS SCALES

    Rosenfeld, J. S., Rosenfeld, A., Belinkov, Y. & Shavit, N., 2020.

    Research output: Contribution to conference › Paper › peer-review

    54 Scopus citations
  • 2014

    StackTrack: An automated transactional approach to concurrent memory reclamation

    Alistarh, D., Eugster, P., Herlihy, M., Matveev, A. & Shavit, N., 2014.

    Research output: Contribution to conference › Paper › peer-review

    45 Scopus citations
  • 2005

    Using elimination to implement scalable and lock-free FIFO queues

    Moir, M., Nussbaum, D., Shalev, O. & Shavit, N., 2005, p. 253-262. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    101 Scopus citations

  • Virtual leashing: Internet-based software piracy protection

    Dvir, O., Herlihy, M. & Shavit, N. N., 2005, p. 283-292. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    9 Scopus citations
  • 2004

    A scalable lock-free stack algorithm

    Hendler, D., Shavit, N. & Yerushalmi, L., 2004, p. 206-215. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    164 Scopus citations

  • DCAS is not a silver bullet for nonblocking algorithm design

    Doherty, S., Detlefs, D. L., Groves, L., Flood, C. H., Luchangco, V., Martin, P. A., Moir, M., Shavit, N. & Steele, G. L., 2004, p. 216-224. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    51 Scopus citations

  • On the inherent weakness of conditional synchronization primitives

    Fich, F., Hendler, D. & Shavit, N., 2004, p. 80-87. 8 p.

    Research output: Contribution to conference › Paper › peer-review

    10 Scopus citations
  • 2003

    Nonblocking k-compare-single-swap

    Luchangco, V., Moir, M. & Shavit, N., 2003, p. 314-323. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    41 Scopus citations

  • Operation-Valency and the Cost of Coordination

    Hendler, D. & Shavit, N., 2003, p. 84-91. 8 p.

    Research output: Contribution to conference › Paper › peer-review

    10 Scopus citations

  • Split-Ordered Lists: Lock-Free Extensible Hash Tables

    Shalev, O. & Shavit, N., 2003, p. 102-111. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    30 Scopus citations
  • 2002

    Non-blocking steal-half work queues

    Hendler, D. & Shavit, N., 2002, p. 280-289. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    80 Scopus citations

  • Work dealing

    Hendler, D. & Shavit, N., 2002, p. 164-172. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    12 Scopus citations
  • 2000

    DCAS-based concurrent deques

    Agesen, O., Detlefs, D. L., Flood, C. H., Garthwaite, A. T., Martin, P. A., Shavit, N. N. & Steele, G. L., 2000, p. 137-146. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    18 Scopus citations
  • 1999

    Scalable concurrent priority queue algorithms

    Shavit, N. & Zemach, A., 1999, p. 113-122. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    22 Scopus citations
  • 1998

    Combining funnels

    Shavit, N. & Zemach, A., 1998, p. 61-70. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    7 Scopus citations
  • 1997

    Reactive diffracting trees

    Della-Libera, G. & Shavit, N., 1997, p. 24-32. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    3 Scopus citations

  • Towards a topological characterization of asynchronous complexity

    Hoest, G. & Shavit, N., 1997, p. 199-208. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    22 Scopus citations

  • Wait-free sorting algorithm

    Shavit, N., Upfal, E. & Zemach, A., 1997, p. 121-128. 8 p.

    Research output: Contribution to conference › Paper › peer-review

    4 Scopus citations
  • 1996

    Counting networks are practically linearizable

    Lynch, N., Shavit, N., Shvartsman, A. & Touitou, D., 1996, p. 280-289. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    3 Scopus citations

  • Steady state analysis of diffracting trees

    Shavit, N., Upfal, E. & Zemach, A., 1996, p. 33-41. 9 p.

    Research output: Contribution to conference › Paper › peer-review

    5 Scopus citations
  • 1995

    Elimination trees and the construction of pools and stacks

    Shavit, N. & Touitou, D., 1995, p. 54-63. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    38 Scopus citations

  • Software transactional memory

    Shavit, N. & Touitou, D., 1995, p. 204-213. 10 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    754 Scopus citations
  • 1990

    Atomic snapshots of shared memory

    Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M. & Shavit, N., 1990, p. 1-13. 13 p.

    Research output: Contribution to conference › Paper › peer-review

    Open Access
    57 Scopus citations