Relaxed concurrent ordering structures by Kopinsky, Justin

Get full text

Fast long lived renaming by Kopinsky, Justin

Get full text

The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm by Alistarh, Dan, Kopinsky, Justin, Matveev, Alexander, Shavit, Nir N.

Get full text
Get full text
Get full text
Get full text

The SprayList: a scalable relaxed priority queue by Alistarh, Dan, Kopinsky, Justin, Li, Jerry Zheng, Shavit, Nir N.

Get full text
Get full text
Get full text
Get full text

Inherent limitations of hybrid transactional memory by Alistarh, Dan, Kuznetsov, Petr, Ravi, Srivatsan, Kopinsky, Justin, Shavit, Nir N.

Get full text
Get full text
Get full text

Infinite All-Layers Simple Foldability by Akitaya, Hugo A, Avery, Cordelia, Bergeron, Joseph, Demaine, Erik D, Kopinsky, Justin, Ku, Jason S

Get full text

Path Puzzles: Discrete Tomography with a Path Constraint is Hard by Bosboom, Jeffrey, Demaine, Erik D, Demaine, Martin L, Hesterberg, Adam, Kimball, Roderick, Kopinsky, Justin

Get full text

Who witnesses the witness? Finding witnesses in the witness is hard and sometimes impossible by Abel, Zachary R, Bosboom, Jeffrey William, Demaine, Erik D, Hamilton, Linus Ulysses, Hesterberg, Adam Classen, Kopinsky, Justin, Lynch, Jayson R., Rudoy, Mikhail

Get full text

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible by Abel, Zachary R, Bosboom, Jeffrey William, Coulombe, Michael Joseph, Demaine, Erik D., Hamilton, Linus, Hesterberg, Adam, Kopinsky, Justin, Lynch, Jayson R., Rudoy, Mikhail, Thielen, Clemens

Get full text