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
Get journal articles
Get journal articles
Get my own profile
Cited by
View all
All
Since 2019
Citations
54
35
h-index
4
3
i10-index
3
2
0
10
5
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
4
4
5
2
4
6
5
6
4
9
5
Public access
View all
View all
2 articles
0 articles
available
not available
Based on funding mandates
Follow
Max Rabkin
Saarland University
Verified email at stud.uni-saarland.de
formal languages
complexity theory
cryptography
Articles
Cited by
Public access
Title
Sort
Sort by citations
Sort by year
Sort by title
Cited by
Cited by
Year
Verifiably encrypted signatures: security revisited and a new construction
C Hanser, M Rabkin, D Schröder
Computer Security--ESORICS 2015: 20th European Symposium on Research in …
, 2015
18
2015
Functional Credentials
D Deuber, M Maffei, G Malavolta, M Rabkin, D Schröder, M Simkin
Proceedings on Privacy Enhancing Technologies 2018 (2), 64-84
, 2018
13
2018
Recognizing two-sided contexts in cubic time
M Rabkin
Computer Science-Theory and Applications: 9th International Computer Science …
, 2014
11
2014
Ogden’s lemma for ET0L languages
M Rabkin
Language and Automata Theory and Applications: 6th International Conference …
, 2012
9
2012
Ogden's lemma for random permitting-and forbidding-context and ET0L languages
MS Rabkin
University of the Witwatersrand, Faculty of Science, School of Computer Science
, 2012
3
2012
Generalized Random Context Picture Grammars: The State of the Art
S Ewert, M Rabkin
Languages Alive, 56-74
, 2012
2012
Is P equal to NP: Or, are quick crosswords quick?
M Rabkin
2009
The system can't perform the operation now. Try again later.
Articles 1–7
Show more
Privacy
Terms
Help
About Scholar
Search help