@article{MTMT:34108861,
	title = {Certification of qubits in the prepare-and-measure scenario with large input alphabet and connections with the Grothendieck constant},
	url = {https://m2.mtmt.hu/api/publication/34108861},
	author = {Diviánszky, Péter and Márton, István and Bene, Erika and Vértesi, Tamás},
	doi = {10.1038/s41598-023-39529-0},
	journal-iso = {SCI REP},
	journal = {SCIENTIFIC REPORTS},
	volume = {13},
	unique-id = {34108861},
	issn = {2045-2322},
	year = {2023},
	eissn = {2045-2322},
	orcid-numbers = {Márton, István/0000-0001-7024-8245}
}

@CONFERENCE{MTMT:3407827,
	title = {Constructing inductive-inductive types using a domain-specific type theory},
	url = {https://m2.mtmt.hu/api/publication/3407827},
	author = {Altenkirch, Thorsten and Diviánszky, Péter and Kaposi, Ambrus and Kovács, András},
	booktitle = {24th International Conference on Types for Proofs and Programs. TYPES 2018. Abstracts},
	unique-id = {3407827},
	year = {2018},
	pages = {15-16},
	orcid-numbers = {Kaposi, Ambrus/0000-0001-9897-8936}
}

@{MTMT:3287903,
	title = {Derivation of elimination principles from a context},
	url = {https://m2.mtmt.hu/api/publication/3287903},
	author = {Kaposi, Ambrus and Kovács, András and Diviánszky, Péter and Kőműves, Balázs},
	booktitle = {23rd International Conference on Types for Proofs and Programs, TYPES 2017},
	unique-id = {3287903},
	year = {2017},
	pages = {69-70},
	orcid-numbers = {Kaposi, Ambrus/0000-0001-9897-8936}
}

@article{MTMT:3271261,
	title = {Qutrit witness from the Grothendieck constant of order four},
	url = {https://m2.mtmt.hu/api/publication/3271261},
	author = {Diviánszky, Péter and Bene, Erika and Vértesi, Tamás},
	doi = {10.1103/PhysRevA.96.012113},
	journal-iso = {PHYS REV A},
	journal = {PHYSICAL REVIEW A},
	volume = {96},
	unique-id = {3271261},
	issn = {2469-9926},
	abstract = {In this paper, we prove that KG(3)<KG(4), where KG(d) denotes the Grothendieck constant of order d. To this end, we use a branch-and-bound algorithm commonly used in the solution of NP-hard problems. It has recently been proven that KG(3)≤1.4644. Here we prove that KG(4)≥1.4841, which has implications for device-independent witnessing dimensions greater than two. Furthermore, the algorithm with some modifications may find applications in various black-box quantum information tasks with large number of inputs and outputs. © 2017 American Physical Society.},
	keywords = {Computational complexity; Branch and bound method; Branch-and-bound algorithms; quantum optics; quantum information; Black boxes},
	year = {2017},
	eissn = {2469-9934}
}

@article{MTMT:3050854,
	title = {Bounding the persistency of the nonlocality of W states},
	url = {https://m2.mtmt.hu/api/publication/3050854},
	author = {Diviánszky, Péter and Trencsényi, Réka Eszter and Bene, Erika and Vértesi, Tamás},
	doi = {10.1103/PhysRevA.93.042113},
	journal-iso = {PHYS REV A},
	journal = {PHYSICAL REVIEW A},
	volume = {93},
	unique-id = {3050854},
	issn = {2469-9926},
	year = {2016},
	eissn = {2469-9934}
}

@inproceedings{MTMT:2079946,
	title = {A funkcionális programozás tanulásának támogatása interaktív tanulássegítő eszközökkel},
	url = {https://m2.mtmt.hu/api/publication/2079946},
	author = {Diviánszky, Péter and Páli, Gábor},
	booktitle = {Informatika a felsőoktatásban 2011 konferencia},
	unique-id = {2079946},
	year = {2011},
	pages = {518-525}
}

@CONFERENCE{MTMT:1961392,
	title = {Size Analysis of Higher-Order Functions},
	url = {https://m2.mtmt.hu/api/publication/1961392},
	author = {Diviánszky, Péter and Góbi, Attila and Kozsik, Tamás},
	booktitle = {Foundational and Practical Aspects of Resource Analysis},
	unique-id = {1961392},
	abstract = {The paper describes a resource analysis method for strict 
		functional languages. The method is applicable for higher order 
		functions. It provides lower and upper bounds for strictly 
		increasing resource costs like execution time and the number of 
		total allocated memory during execution. The key component 
		described here is a calculus which is used for abstract 
		interpretation of expressions and functions with free variables. 
		The result of the abstract interpretation is a system of 
		mutually recursive equations for costs.},
	year = {2011},
	pages = {23-37},
	orcid-numbers = {Góbi, Attila/0000-0003-3276-0883; Kozsik, Tamás/0000-0003-4484-9172}
}

@article{MTMT:2149149,
	title = {Non-monadic Models of Mutable References},
	url = {https://m2.mtmt.hu/api/publication/2149149},
	author = {Diviánszky, Péter},
	doi = {10.1007/978-3-642-17685-2_5},
	journal-iso = {LNCS},
	journal = {LECTURE NOTES IN COMPUTER SCIENCE},
	volume = {6299},
	unique-id = {2149149},
	issn = {0302-9743},
	year = {2010},
	eissn = {1611-3349},
	pages = {147-187}
}

@article{MTMT:2149139,
	title = {Efficient Implementation of Linearly Used Finite Maps},
	url = {https://m2.mtmt.hu/api/publication/2149139},
	author = {Diviánszky, Péter},
	journal-iso = {ANN UNIV SCI BP R EÖTVÖS NOM SECT COMPUT},
	journal = {ANNALES UNIVERSITATIS SCIENTIARUM BUDAPESTINENSIS DE ROLANDO EOTVOS NOMINATAE SECTIO COMPUTATORICA},
	volume = {30},
	unique-id = {2149139},
	issn = {0138-9491},
	year = {2009},
	pages = {201-218}
}

@inproceedings{MTMT:2074365,
	title = {Detaching and reconstructing the documentary structure of source code},
	url = {https://m2.mtmt.hu/api/publication/2074365},
	author = {Diviánszky, Péter and Góbi, Attila and Leskó, Dániel and Móni, Mészáros and Páli, Gábor},
	booktitle = {Tenth Symposium on Trends in Functional Programming},
	unique-id = {2074365},
	year = {2009},
	pages = {43-58},
	orcid-numbers = {Góbi, Attila/0000-0003-3276-0883; Leskó, Dániel/0000-0001-9886-9537}
}