Ali Sezgin
Henzinger_Thomas Group
9 Publications
2021 | Published | Journal Article | IST-REx-ID: 9647 |
Long lived transients in gene regulation
T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.
[Published Version]
View
| Files available
| DOI
| WoS
T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.
2019 | Published | Conference Paper | IST-REx-ID: 7147
Transient memory in gene regulation
C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.
View
| DOI
| WoS
C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.
2016 | Published | Conference Paper | IST-REx-ID: 1095 |
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.
[Published Version]
View
| Files available
| DOI
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.
2013 | Published | Technical Report | IST-REx-ID: 5402 |
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
2013 | Published | Technical Report | IST-REx-ID: 6440 |
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.
[Published Version]
View
| Files available
| DOI
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
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.
[Submitted Version]
View
| Files available
| DOI
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.
2013 | Published | Conference Paper | IST-REx-ID: 2328 |
Aspect-oriented linearizability proofs
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
[Submitted Version]
View
| Files available
| DOI
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
2013 | Published | Conference Paper | IST-REx-ID: 10898
Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation
A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.
View
| DOI
A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.
2012 | Published | 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
C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.
Grants
9 Publications
2021 | Published | Journal Article | IST-REx-ID: 9647 |
Long lived transients in gene regulation
T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.
[Published Version]
View
| Files available
| DOI
| WoS
T. Petrov, C. Igler, A. Sezgin, T.A. Henzinger, C.C. Guet, Theoretical Computer Science 893 (2021) 1–16.
2019 | Published | Conference Paper | IST-REx-ID: 7147
Transient memory in gene regulation
C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.
View
| DOI
| WoS
C.C. Guet, T.A. Henzinger, C. Igler, T. Petrov, A. Sezgin, in:, 17th International Conference on Computational Methods in Systems Biology, Springer Nature, 2019, pp. 155–187.
2016 | Published | Conference Paper | IST-REx-ID: 1095 |
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.
[Published Version]
View
| Files available
| DOI
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.
2013 | Published | Technical Report | IST-REx-ID: 5402 |
How free is your linearizable concurrent data structure?
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
[Published Version]
View
| Files available
| DOI
T.A. Henzinger, A. Sezgin, How Free Is Your Linearizable Concurrent Data Structure?, IST Austria, 2013.
2013 | Published | Technical Report | IST-REx-ID: 6440 |
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.
[Published Version]
View
| Files available
| DOI
T.A. Henzinger, H. Payer, A. Sezgin, Replacing Competition with Cooperation to Achieve Scalable Lock-Free FIFO Queues , IST Austria, 2013.
2013 | Published | Conference Paper | IST-REx-ID: 2181 |
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.
[Submitted Version]
View
| Files available
| DOI
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.
2013 | Published | Conference Paper | IST-REx-ID: 2328 |
Aspect-oriented linearizability proofs
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
[Submitted Version]
View
| Files available
| DOI
T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
2013 | Published | Conference Paper | IST-REx-ID: 10898
Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation
A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.
View
| DOI
A. Haas, M. Lippautz, T.A. Henzinger, H. Payer, A. Sokolova, C.M. Kirsch, A. Sezgin, in:, Proceedings of the ACM International Conference on Computing Frontiers - CF ’13, ACM Press, 2013.
2012 | Published | 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
C.C. Guet, A. Gupta, T.A. Henzinger, M. Mateescu, A. Sezgin, in:, Springer, 2012, pp. 294–309.