Ali Sezgin

Henzinger_Thomas Group

9 Publications

Mark all

[9]
2021 | Journal Article | IST-REx-ID: 9647 | OA
Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.
[Published Version] View | Files available | DOI | WoS
 
[8]
2019 | Conference Paper | IST-REx-ID: 7147
Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory in gene regulation. 17th International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773, 155–187.
View | DOI | WoS
 
[7]
2016 | Conference Paper | IST-REx-ID: 1095 | OA
Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A, Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 6.
[Published Version] View | Files available | DOI
 
[6]
2013 | Conference Paper | IST-REx-ID: 10898
Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.
View | DOI
 
[5]
2013 | Conference Paper | IST-REx-ID: 2181 | OA
Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.
[Submitted Version] View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2328 | OA
Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.
[Submitted Version] View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5402 | OA
Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.
[Published Version] View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 6440 | OA
Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.
[Published Version] View | Files available | DOI
 
[1]
2012 | Conference Paper | IST-REx-ID: 3136
Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed

9 Publications

Mark all

[9]
2021 | Journal Article | IST-REx-ID: 9647 | OA
Petrov T, Igler C, Sezgin A, Henzinger TA, Guet CC. 2021. Long lived transients in gene regulation. Theoretical Computer Science. 893, 1–16.
[Published Version] View | Files available | DOI | WoS
 
[8]
2019 | Conference Paper | IST-REx-ID: 7147
Guet CC, Henzinger TA, Igler C, Petrov T, Sezgin A. 2019. Transient memory in gene regulation. 17th International Conference on Computational Methods in Systems Biology. CMSB: Computational Methods in Systems Biology, LNCS, vol. 11773, 155–187.
View | DOI | WoS
 
[7]
2016 | Conference Paper | IST-REx-ID: 1095 | OA
Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A, Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 6.
[Published Version] View | Files available | DOI
 
[6]
2013 | Conference Paper | IST-REx-ID: 10898
Haas A, Lippautz M, Henzinger TA, Payer H, Sokolova A, Kirsch CM, Sezgin A. 2013. Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation. Proceedings of the ACM International Conference on Computing Frontiers - CF ’13. CF: Conference on Computing Frontiers, 17.
View | DOI
 
[5]
2013 | Conference Paper | IST-REx-ID: 2181 | OA
Henzinger TA, Kirsch C, Payer H, Sezgin A, Sokolova A. 2013. Quantitative relaxation of concurrent data structures. Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language. POPL: Principles of Programming Languages, 317–328.
[Submitted Version] View | Files available | DOI
 
[4]
2013 | Conference Paper | IST-REx-ID: 2328 | OA
Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability proofs. 8052, 242–256.
[Submitted Version] View | Files available | DOI
 
[3]
2013 | Technical Report | IST-REx-ID: 5402 | OA
Henzinger TA, Sezgin A. 2013. How free is your linearizable concurrent data structure?, IST Austria, 16p.
[Published Version] View | Files available | DOI
 
[2]
2013 | Technical Report | IST-REx-ID: 6440 | OA
Henzinger TA, Payer H, Sezgin A. 2013. Replacing competition with cooperation to achieve scalable lock-free FIFO queues , IST Austria, 23p.
[Published Version] View | Files available | DOI
 
[1]
2012 | Conference Paper | IST-REx-ID: 3136
Guet CC, Gupta A, Henzinger TA, Mateescu M, Sezgin A. 2012. Delayed continuous time Markov chains for genetic regulatory circuits. CAV: Computer Aided Verification, LNCS, vol. 7358, 294–309.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

    • Display / Sort

    Citation Style: ISTA Annual Report

    Export / Embed