Organization
Faculty of Science and Engineering Research Associate
Contact information
The inquiry by e-mail is 《here》
External link
FULLA, Peter
Degree
-
DPhil ( University of Oxford, UK )
-
MSc ( Comenius University, Slovakia )
Education
-
2018.10
University of Oxford, UK (DPhil) doctor course completed
-
2014.6
Comenius University, Slovakia (MSc) master course completed
-
2012.6
Comenius University, Slovakia (BSc) graduated
Research History
-
2021.4 - Now
中央大学理工学部 助教
-
2018.10 - 2021.3
National Institute of Informatics
-
2015.6 - 2015.9
IBM Research in Zurich, Switzerland SWE Intern
-
2013.7 - 2013.10
Google in Mountain View, California SWE Intern
-
2012.6 - 2012.9
Google in Zurich, Switzerland SWE Intern
-
2011.7 - 2011.9
Google in Zurich, Switzerland SWE Intern
Research Areas
-
Informatics / Mathematical informatics
Papers
-
Inequity aversion pricing over social networks: Approximation algorithms and hardness results Reviewed
Georgios Amanatidis, Peter Fulla, Evangelos Markakis, Krzysztof Sornat
Theoretical Computer Science 871 62 - 78 2021.6
-
The Complexity of Boolean Surjective General-Valued CSPs Reviewed
P. Fulla, H. Uppman, S. Živný
Transactions on Computation Theory 11 ( 1 ) 4:1 - 4:31 2018
-
On Planar Valued CSPs Reviewed
P. Fulla, S. Živný
Journal of Computer and System Sciences 87 104 - 118 2017
-
The Complexity of Boolean Surjective General-Valued CSPs Reviewed
P. Fulla, S. Živný
42nd International Symposium on Mathematical Foundations of Computer Science 4:1 - 4:14 2017
-
A Galois Connection for Weighted (Relational) Clones of Infinite Size Reviewed
P. Fulla, S. Živný
Transactions on Computation Theory 8 ( 3 ) 9:1 - 9:21 2016
-
On Planar Valued CSPs Reviewed
P. Fulla, S. Živný
41st International Symposium on Mathematical Foundations of Computer Science 39:1 - 39:14 2016
-
A Galois Connection for Valued Constraint Languages of Infinite Size Reviewed
P. Fulla, S. Živný
Automata, Languages, and Programming – 42nd International Colloquium 517 - 528 2015
Presentations
-
Computational complexity: Some problems are harder than others (and that may be a good thing)
2022.12
-
The Complexity of Boolean Surjective General-Valued CSPs International conference
P. Fulla
42nd International Symposium on Mathematical Foundations of Computer Science 2017
-
On Planar Valued CSPs International conference
P. Fulla
41st International Symposium on Mathematical Foundations of Computer Science 2016
-
A Galois Connection for Valued Constraint Languages of Infinite Size International conference
P. Fulla
Automata, Languages, and Programming – 42nd International Colloquium 2015