6 Publications

Mark all

[6]
2016 | Conference Paper | IST-REx-ID: 1095   OA
Local linearizability for concurrent container-type data structures
A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A. Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 
[5]
2013 | Technical Report | IST-REx-ID: 6440   OA
Replacing competition with cooperation to achieve scalable lock-free FIFO queues
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2328   OA
Aspect-oriented linearizability proofs
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
View | Files available | DOI
 
[3]
2013 | Conference Paper | IST-REx-ID: 2181   OA
Quantitative relaxation of concurrent data structures
T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.
View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5402   OA
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
View | Files available | DOI
 
[1]
2012 | Conference Paper | IST-REx-ID: 3136
Delayed continuous time Markov chains for genetic regulatory circuits
C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.
View | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed

6 Publications

Mark all

[6]
2016 | Conference Paper | IST-REx-ID: 1095   OA
Local linearizability for concurrent container-type data structures
A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A. Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
View | Files available | DOI
 
[5]
2013 | Technical Report | IST-REx-ID: 6440   OA
Replacing competition with cooperation to achieve scalable lock-free FIFO queues
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2328   OA
Aspect-oriented linearizability proofs
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
View | Files available | DOI
 
[3]
2013 | Conference Paper | IST-REx-ID: 2181   OA
Quantitative relaxation of concurrent data structures
T.A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, A. Sokolova, in:, Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, ACM, 2013, pp. 317–328.
View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 5402   OA
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
View | Files available | DOI
 
[1]
2012 | Conference Paper | IST-REx-ID: 3136
Delayed continuous time Markov chains for genetic regulatory circuits
C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.
View | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed