Comments on Convex Hull of a Finite Set of Points in Two Dimensions. - Ferenc Dévai; Tibor Szendrényi (Inf. Process. Lett., 1979)

Quadratic Bounds for Hidden Line Elimination. - Ferenc Dévai (SCG, 1986)

An O(log N) Parallel Time Exact Hidden-Line Algorithm. - Ferenc Dévai (Advances in Computer Graphics Hardware, 1987)

An Intersection-Sensitive Hidden-Surface Algorithm. - Ferenc Dévai (Eurographics, 1987)

On the Computational Requirements of Virtual Reality Systems. - Frank Dévai (Eurographics (State of the Art Reports), 1997)

An Analysis Technique and an Algorithm for Line Clipping. - Ferenc Dévai (IV, 1998)

The Suitability of the Java Language for Computer-Graphics and Visualisation Research. - Frank Dévai; Mizanur Rahman (IV, 2002)

Analysis of the Nicholl-Lee-Nicholl Algorithm. - Frank Dévai (ICCSA (1), 2005)

High-Performance Rendering on Clusters of Workstations. - Sourav Dalal; Frank Dévai; Mizanur Rahman (GMAI, 2006)

A Speculative Approach to Clipping Line Segments. - Frank Dévai (ICCSA (1), 2006)

Determining the Visibility of a Planar Set of Line Segments in O(n log log n) Time. - Frank Dévai; Marina L. Gavrilova (ICCSA (2), 2007)

A Rectangle-Intersection Algorithm with Limited Resource Requirements. - Frank Dévai; László Neumann (CIT, 2010)

An Optimal Hidden-Surface Algorithm and Its Parallelization. - Frank Dévai (ICCSA (3), 2011)

The Refutation of Amdahl's Law and Its Variants. - Ferenc Dévai (Trans. Comput. Sci., 2018)