PhD in Computer Science
Institute of Science and Technology Austria, 2021
Quantitative Bounds on Resource Usage of Probabilistic Programs
Article
Congesting Ethereum after EIP-1559
Conference paper
Faster Treewidth-Based Approximations for Wiener Index
Conference paper
Gas-Efficient Decentralized Random Beacons
Conference paper
Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic
Conference paper
Conference paper
SRNG: An Efficient Decentralized Approach for Secret Random Number Generation
Conference paper
Asparagus: Automated Synthesis of Parametric Gas Upper-Bounds for Smart Contracts
Article
Article
The Bounded Pathwidth of Control-Flow Graphs
Article
Algebro-geometric Algorithms for Template-based Synthesis of Polynomial Programs
Conference paper
Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts
Conference paper
Automated Tail Bound Analysis for Probabilistic Recurrence Relations
Conference paper
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth
Conference paper
PureLottery: Fair Leader Election without Decentralized Random Number Generation
Conference paper
Reducing the Gas Usage of Ethereum Smart Contracts without a Sidechain
Conference paper
Secure and Decentralized Generation of Secret Random Numbers on the Blockchain
Conference paper
Trustless and Bias-resistant Game-theoretic Distributed Randomness
Conference paper
Algorithms and Hardness Results for Computing Cores of Markov Chains
Conference paper
Efficient Approximations for Cache-conscious Data Placement
Conference paper
Optimal Mining: Maximizing Bitcoin Miners’ Revenues From Transaction Fees
Conference paper
Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
Conference paper
Conference paper
Polynomial Reachability Witnesses via Stellensätze
Conference paper
Quantitative Analysis of Assertion Violations in Probabilistic Programs
Conference paper
A note on belief structures and s-approximation spaces
Article
An efficient algorithm for computing network reliability in small treewidth
Article
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth
Conference paper
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis
Conference paper
Polynomial invariant generation for non-deterministic recursive programs
Conference paper
Efficient Parameterized Algorithms for Data Packing
Article
Faster algorithms for dynamic algebraicqueries in basic RSMs with constant treewidth
Article
Modular Verification for Almost-Sure Termination of Probabilistic Programs
Article
Non-polynomial worst-case analysis of recursive programs
Article
Cost analysis of nondeterministic probabilistic programs
Conference paper
Hybrid mining exploiting blockchain's computational power for distributed problem solving
Conference paper
Probabilistic smart contracts: Secure randomness on the blockchain
Conference paper
The treewidth of smart contracts
Conference paper
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
Article
Computational approaches for stochastic shortest path on succinct MDPs
Conference paper
Ergodic mean-payo games for the analysis of attacks in crypto-currencies
Conference paper
Quantitative analysis of smart contracts
Conference paper
Secure Credit Reporting on the Blockchain
Conference paper
JTDec: A tool for tree decompositions in soot
Conference paper
Non-polynomial worst-case analysis of recursive programs
Conference paper
[1,2]-sets and [1,2]-total sets in trees with algorithms
Article
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
Conference paper
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
Conference paper
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
Conference paper
Conference paper
S-Approximation: A New Approach to Algebraic Approximation
Article
Algebro-geometric Algorithms for Template-based Synthesis of Polynomial Programs
Alleviating High Gas Costs by Secure and Trustless Off-chain Execution of Smart Contracts
Automated Tail Bound Analysis for Probabilistic Recurrence Relations
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth
PureLottery: Fair Leader Election without Decentralized Random Number Generation
Reducing the Gas Usage of Ethereum Smart Contracts without a Sidechain
Secure and Decentralized Generation of Secret Random Numbers on the Blockchain
Trustless and Bias-resistant Game-theoretic Distributed Randomness
Algorithms for algebraic path properties in concurrent systems of constant treewidth components
Article
Computational approaches for stochastic shortest path on succinct MDPs
Conference paper
Ergodic mean-payo games for the analysis of attacks in crypto-currencies
Conference paper
Quantitative analysis of smart contracts
Conference paper
Secure Credit Reporting on the Blockchain
Conference paper
JTDec: A tool for tree decompositions in soot
Conference paper
Non-polynomial worst-case analysis of recursive programs
Conference paper
[1,2]-sets and [1,2]-total sets in trees with algorithms
Article
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
Conference paper
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
Conference paper
Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
Conference paper
Conference paper
S-Approximation: A New Approach to Algebraic Approximation
Article
COMP2711H | Honors Discrete Mathematical Tools for Computer Science |
COMP6922B | Research Project |
UROP1100N | Undergraduate Research Opportunities Series 1 |
UROP2100N | Undergraduate Research Opportunities Series 2 |
COMP4981 | Final Year Project |
UROP1000 | Undergraduate Research Opportunities |
UROP1100M | Undergraduate Research Opportunities Series 1 |
COMP3711H | Honors Design and Analysis of Algorithms |
COMP4541 | Blockchain, Cryptocurrencies and Smart Contracts |
COMP4981 | Final Year Project |
COMP4981H | Final Year Thesis |
COMP6922B | Research Project |
CPEG4901 | Computer Engineering Final Year Project in COMP |
COMP4971A | Independent Work |
COMP4981 | Final Year Project |
COMP4981H | Final Year Thesis |
COMP6922B | Research Project |
MATH4985I | Independent Study: Martingale-based Program Analysis |
COMP4901X | Formal Reasoning about Programs |
COMP4971A | Independent Work |
COMP4981 | Final Year Project |
COMP4981H | Final Year Thesis |
No Teaching Assignments |
BALLWEG, Jonas
(co-supervision)
Computer Science and Engineering
BARAKBAYEVA, Togzhan
(co-supervision)
Computer Science and Engineering
CAI, Zhuo
(co-supervision)
Computer Science and Engineering
FAROKHNIA, Soroush
(co-supervision)
Computer Science and Engineering
HUDEC, Pavel
(co-supervision)
Computer Science and Engineering
KOBUS CONRADO, Giovanna
(co-supervision)
Computer Science and Engineering
KOCHEKOV, Kerim
(co-supervision)
Computer Science and Engineering
LI, Pingjiang
(co-supervision)
Computer Science and Engineering
NOVOZHILOV, Sergei
(co-supervision)
Computer Science and Engineering
SHU, Tian
(co-supervision)
Computer Science and Engineering
SINGH, Hitarth
(co-supervision)
Computer Science and Engineering
ZAHER, Ahmed Khaled Abdelfattah
(co-supervision)
Computer Science and Engineering
LAM, Chun Kit
Computer Science and Engineering
CAI, Xuran
(co-supervision)
Computer Science and Engineering
LIN, Zhaorun
(co-supervision)
Computer Science and Engineering
Update your browser to view this website correctly. Update your browser now