Ali Sezgin
9 Publications
2021 | Published | Journal Article | IST-REx-ID: 9647 | 
T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 7147
C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in 17th International Conference on Computational Methods in Systems Biology, Trieste, Italy, 2019, vol. 11773, pp. 155–187.
View
| DOI
| WoS
2016 | Published | Conference Paper | IST-REx-ID: 1095 |
A. Haas et al., “Local linearizability for concurrent container-type data structures,” in Leibniz International Proceedings in Informatics, Quebec City; Canada, 2016, vol. 59.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5402 |
T. A. Henzinger and A. Sezgin, How free is your linearizable concurrent data structure? IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 6440 |
T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 10898
A. Haas et al., “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013, no. 5.
View
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2328 |
T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.
[Submitted Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 3136
C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.
View
| DOI
Grants
9 Publications
2021 | Published | Journal Article | IST-REx-ID: 9647 |
T. Petrov, C. Igler, A. Sezgin, T. A. Henzinger, and C. C. Guet, “Long lived transients in gene regulation,” Theoretical Computer Science, vol. 893. Elsevier, pp. 1–16, 2021.
[Published Version]
View
| Files available
| DOI
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 7147
C. C. Guet, T. A. Henzinger, C. Igler, T. Petrov, and A. Sezgin, “Transient memory in gene regulation,” in 17th International Conference on Computational Methods in Systems Biology, Trieste, Italy, 2019, vol. 11773, pp. 155–187.
View
| DOI
| WoS
2016 | Published | Conference Paper | IST-REx-ID: 1095 |
A. Haas et al., “Local linearizability for concurrent container-type data structures,” in Leibniz International Proceedings in Informatics, Quebec City; Canada, 2016, vol. 59.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 5402 |
T. A. Henzinger and A. Sezgin, How free is your linearizable concurrent data structure? IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 | Published | Technical Report | IST-REx-ID: 6440 |
T. A. Henzinger, H. Payer, and A. Sezgin, Replacing competition with cooperation to achieve scalable lock-free FIFO queues . IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
T. A. Henzinger, C. Kirsch, H. Payer, A. Sezgin, and A. Sokolova, “Quantitative relaxation of concurrent data structures,” in Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming language, Rome, Italy, 2013, pp. 317–328.
[Submitted Version]
View
| Files available
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 10898
A. Haas et al., “Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation,” in Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, Ischia, Italy, 2013, no. 5.
View
| DOI
2013 | Published | Conference Paper | IST-REx-ID: 2328 |
T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256, 2013.
[Submitted Version]
View
| Files available
| DOI
2012 | Published | Conference Paper | IST-REx-ID: 3136
C. C. Guet, A. Gupta, T. A. Henzinger, M. Mateescu, and A. Sezgin, “Delayed continuous time Markov chains for genetic regulatory circuits,” presented at the CAV: Computer Aided Verification, Berkeley, CA, USA, 2012, vol. 7358, pp. 294–309.
View
| DOI