Péter Szeredi

474 total citations
18 papers, 138 citations indexed

About

Péter Szeredi is a scholar working on Artificial Intelligence, Computer Networks and Communications and Signal Processing. According to data from OpenAlex, Péter Szeredi has authored 18 papers receiving a total of 138 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 5 papers in Computer Networks and Communications and 2 papers in Signal Processing. Recurrent topics in Péter Szeredi's work include Semantic Web and Ontologies (6 papers), Logic, programming, and type systems (5 papers) and Logic, Reasoning, and Knowledge (4 papers). Péter Szeredi is often cited by papers focused on Semantic Web and Ontologies (6 papers), Logic, programming, and type systems (5 papers) and Logic, Reasoning, and Knowledge (4 papers). Péter Szeredi collaborates with scholars based in Hungary, United Kingdom and Sweden. Péter Szeredi's co-authors include David H. Warren, Ferenç Darvas, Zsolt Nagy, Per Brand, Terry Disz, Ross Overbeek, Robert Olson, Ewing Lusk, Rick Stevens and Mats Carlsson and has published in prestigious journals such as The American Journal of Gastroenterology, Science of Computer Programming and Theory and Practice of Logic Programming.

In The Last Decade

Péter Szeredi

15 papers receiving 120 citations

Peers

Péter Szeredi
Geoffrey Burn United Kingdom
Andreas Lochbihler Switzerland
Jaroslav Ševčík United Kingdom
Ernie Cohen United States
Geoffrey Burn United Kingdom
Péter Szeredi
Citations per year, relative to Péter Szeredi Péter Szeredi (= 1×) peers Geoffrey Burn

Countries citing papers authored by Péter Szeredi

Since Specialization
Citations

This map shows the geographic impact of Péter Szeredi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Péter Szeredi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Péter Szeredi more than expected).

Fields of papers citing papers by Péter Szeredi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Péter Szeredi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Péter Szeredi. The network helps show where Péter Szeredi may publish in the future.

Co-authorship network of co-authors of Péter Szeredi

This figure shows the co-authorship network connecting the top 25 collaborators of Péter Szeredi. A scholar is included among the top collaborators of Péter Szeredi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Péter Szeredi. Péter Szeredi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Szeredi, Péter, et al.. (2014). The Semantic Web Explained. Cambridge University Press eBooks. 10 indexed citations
2.
Szeredi, Péter, et al.. (2011). Static Type Checking for the Q Functional Language in Prolog. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).
3.
Szeredi, Péter, et al.. (2009). Efficient description logic reasoning in Prolog: The DLog system. Theory and Practice of Logic Programming. 9(3). 343–414. 10 indexed citations
4.
Szeredi, Péter, et al.. (2009). Plagiarism Detection in Source Programs Using Structural Similarities. Acta Cybernetica. 19(1). 191–216. 3 indexed citations
5.
Szeredi, Péter, et al.. (2007). Ontology Based Information Integration Using Logic Programming.. The American Journal of Gastroenterology. 82(2). 135–8. 1 indexed citations
6.
Nagy, Zsolt, et al.. (2006). Description logic reasoning using the PTTP approach.. Description Logics. 1 indexed citations
7.
Szeredi, Péter. (2004). Teaching constraints through logic puzzles.
8.
Szeredi, Péter. (1992). Exploiting Or-Parallelism in Optimisation Problems.. 703–716. 2 indexed citations
9.
Szeredi, Péter. (1992). Logic Programming: Proceedings of the 1990 North American Conference. Science of Computer Programming. 18(2). 213–215. 2 indexed citations
10.
Szeredi, Péter. (1991). Using Dynamic Predicates in an Or--Parallel Prolog System.. 355–371. 5 indexed citations
11.
Szeredi, Péter & David H. Warren. (1990). Logic Programming Proceedings of the Seventh International Conference. MIT Press eBooks. 22 indexed citations
12.
Lusk, Ewing, Ralph Butler, Terry Disz, et al.. (1990). The Aurora or-parallel Prolog system. New Generation Computing. 7(2-3). 243–271. 24 indexed citations
13.
Szeredi, Péter & Mats Carlsson. (1990). The Engine-Scheduler interface in the Aurora Or-Parallel Prolog system. 1 indexed citations
14.
Szeredi, Péter, et al.. (1989). Scheduling Or-parallelism in Aurora: The Manchester Scheduler.. International Conference on Lightning Protection. 419–435. 19 indexed citations
15.
Szeredi, Péter. (1989). Performance Analysis of the Aurora Or-Parallel Prolog System.. 713–732. 23 indexed citations
16.
Szeredi, Péter, et al.. (1983). Prolog in Practice.. IFIP Congress. 627–636. 5 indexed citations
17.
Szeredi, Péter, et al.. (1982). LDM: A Program Specification Support System.. International Conference on Lightning Protection. 123–128. 2 indexed citations
18.
Darvas, Ferenç, et al.. (1978). Logic-based program system for predicting drug interactions. International Journal of Bio-Medical Computing. 9(4). 259–271. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026