Loading...
The system can't perform the operation now. Try again later.
Citations per year
Duplicate citations
The following articles are merged in Scholar. Their
combined citations
are counted only for the first article.
Merged citations
This "Cited by" count includes citations to the following articles in Scholar. The ones marked
*
may be different from the article in the profile.
Add co-authors
Co-authors
Follow
New articles by this author
New citations to this author
New articles related to this author's research
Email address for updates
Done
My profile
My library
Metrics
Alerts
Settings
Sign in
Sign in
Get my own profile
Public access
View all
View all
2 articles
0 articles
available
not available
Based on funding mandates
Follow
Andrei Draghici
Dphil Sudent,
Oxford University
Verified email at stcatz.ox.ac.uk
Computational Logic
Complexity
Verification
Articles
Public access
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
Reachability in Fixed VASS: Expressiveness and Lower Bounds
A Draghici, C Haase, A Ryzhikov
International Conference on Foundations of Software Science and Computation …
, 2024
2024
Sem\" enov Arithmetic, Affine VASS, and String Constraints
A Draghici, C Haase, F Manea
arXiv preprint arXiv:2306.14593
, 2023
2023
On the Complexity of Inductively Learning Guarded Clauses
A Draghici, G Gottlob, M Lanzinger
Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5600-5607
, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–3
Show more
Privacy
Terms
Help
About Scholar
Search help
