Alexandros Gerbessiotis
Alexandros Gerbessiotis
(Alexandros V Gerbessiotis) Associate Professor, Computer Science
4213 Guttenberg Information Technologies Center (GITC)
Education
Ph.D.; Harvard University; Computer Science; 1993
M.S.; Harvard University; Computer Science; 1988
B.S.; National Technical University of Athens; Electrical Engineering; 1987
M.S.; Harvard University; Computer Science; 1988
B.S.; National Technical University of Athens; Electrical Engineering; 1987
Website
2025 Spring Courses
CS 700B - MASTER'S PROJECT
CS 725 - INDEPENDENT STUDY I
CS 488 - INDEPENDENT STUDY IN CS
CS 701B - MASTER'S THESIS
CS 792 - PRE-DOCTORAL RESEARCH
CS 610 - DATA STRUCTURE & ALG
CS 790A - DOCT DISSERTATION & RES
CS 332 - PRINCIPLES OF OPER SYS
CS 726 - INDEPENDENT STUDY II
CS 725 - INDEPENDENT STUDY I
CS 488 - INDEPENDENT STUDY IN CS
CS 701B - MASTER'S THESIS
CS 792 - PRE-DOCTORAL RESEARCH
CS 610 - DATA STRUCTURE & ALG
CS 790A - DOCT DISSERTATION & RES
CS 332 - PRINCIPLES OF OPER SYS
CS 726 - INDEPENDENT STUDY II
Teaching Interests
Design and analysis of sequential and parallel algorithms, High-performance computing, Multi-core, many-core, parallel computing, scientific computing,
and web search
Past Courses
CS 101: COMP PROG & PROB SOLVING
CS 332: PRINCIPLES OF OPER SYS
CS 332: PRINCIPLES OF OPER SYS - HONORS
CS 332: PRINCIPLES OF OPERATING SYSTEMS
CS 345: WEB SEARCH
CS 435: ADV DATA STRUCT-ALG DES
CS 485: SELECTED TOPICS IN CS
CS 485: ST: WEB SEARCH
CS 610: DATA STRUCTURE & ALG
CS 610: DATA STRUCTURES AND ALGORITHMS
CS 667: DESIGN TECH - ALGORITHMS
CS 332: PRINCIPLES OF OPER SYS
CS 332: PRINCIPLES OF OPER SYS - HONORS
CS 332: PRINCIPLES OF OPERATING SYSTEMS
CS 345: WEB SEARCH
CS 435: ADV DATA STRUCT-ALG DES
CS 485: SELECTED TOPICS IN CS
CS 485: ST: WEB SEARCH
CS 610: DATA STRUCTURE & ALG
CS 610: DATA STRUCTURES AND ALGORITHMS
CS 667: DESIGN TECH - ALGORITHMS
Research Interests
Multi-core and parallel computing,
Parallel computing and architecture independent parallel algorithm design and implementation,
experimental algorithmics, use of parallel computing techniques in sequential/serial computing,
interprocessor communication network performance assessment, and graph theory.
In Progress
Multi-core algorithms for financial applications
Study algorithms for financial applications (eg binomial and trinomial option price valuations) and examine their suitability to multi-cores.
Multi-core sorting algorithms
Design of sorting algorithms for multicores, impelementation and study of their performance and benchmarking
Study algorithms for financial applications (eg binomial and trinomial option price valuations) and examine their suitability to multi-cores.
Multi-core sorting algorithms
Design of sorting algorithms for multicores, impelementation and study of their performance and benchmarking
Monograph
“Brief Linux command summary”
September, 2024.
“Connecting to Unix and Linux at NJIT”
August, 2024.
“Unix and Linux compact tutorial”
November, 2023.
“GPU Cuda programming tutorial”
August, 2023.
“Brief on *NIX at NJIT ”
May, 2023.
September, 2024.
“Connecting to Unix and Linux at NJIT”
August, 2024.
“Unix and Linux compact tutorial”
November, 2023.
“GPU Cuda programming tutorial”
August, 2023.
“Brief on *NIX at NJIT ”
May, 2023.
SHOW MORE
Broadcast Media
“Computer Science Department at NJIT : Facts”
May, 2024.
“Rankings of the CS Department at NJIT”
February, 2024.
“Computer Science department at NJIT : Facts”
January (1st Quarter/Winter), 2022.
“Rankings of the CS Department at NJIT”
January (1st Quarter/Winter), 2022.
“Computer Science (CS) Department at NJIT : Facts”
June, 2021.
“Rankings of the CS Department at NJIT”
June, 2021.
“CS Department Facts”
January (1st Quarter/Winter), 2017.
May, 2024.
“Rankings of the CS Department at NJIT”
February, 2024.
“Computer Science department at NJIT : Facts”
January (1st Quarter/Winter), 2022.
“Rankings of the CS Department at NJIT”
January (1st Quarter/Winter), 2022.
“Computer Science (CS) Department at NJIT : Facts”
June, 2021.
“Rankings of the CS Department at NJIT”
June, 2021.
“CS Department Facts”
January (1st Quarter/Winter), 2017.
Book
Alexandros Gerbessiotis, . "Data structures and Algorithms." 468 pp. 2022.
Alexandros Gerbessiotis. "Foundations of Computer Science." 164 pp. 2021.
Alexandros Gerbessiotis. "Foundations of Computer Science." 164 pp. 2021.
Study Guide
“Connecting to *NIX at NJIT”
December, 2021.
“Brief on using *NIX at NJIT”
June, 2021.
December, 2021.
“Brief on using *NIX at NJIT”
June, 2021.
Software
“Optimized serial(sequential) generic, integer, or specified data type sorting”
August, 2021.
“Using parallelism techniques to improve sequential and multi-core sorting performance”
January (1st Quarter/Winter), 2017.
“Sequential Sorting employing parallel computing techniques ”
August, 2016.
“Templates for sequential and multi-core sorting”
Web, August, 2011.
“Sequential Sorting Framework”
November, 2009.
“Option price valuations with the explicit finite difference method: Sequential and Parallel”
April (2nd Quarter/Spring), 2009.
August, 2021.
“Using parallelism techniques to improve sequential and multi-core sorting performance”
January (1st Quarter/Winter), 2017.
“Sequential Sorting employing parallel computing techniques ”
August, 2016.
“Templates for sequential and multi-core sorting”
Web, August, 2011.
“Sequential Sorting Framework”
November, 2009.
“Option price valuations with the explicit finite difference method: Sequential and Parallel”
April (2nd Quarter/Spring), 2009.
Journal Article
Alexandros Gerbessiotis. 2018. "A Study of Integer Sorting on Multicores." Parallel Processing Letters, vol. 28, no. 4, pp. 27.
Alexandros Gerbessiotis. 2015. "Extending the BSP model for multi-core and out-of-core computing: MBSP." Elsevier, vol. 41, no. 1, pp. 90-102.
Alexandros Gerbessiotis, Siniolakis Constantinos J. 2014. "A randomized sorting algorithm on the BSP model." Discrete Mathematics, Algorithms and Applications, vol. 6, no. 4, pp. 42.
Alexandros Gerbessiotis. 2012. "An improved reliability bound of a probabilistic parallel integer sorting algorithm." Elsevier, vol. 112, no. 34, pp. 976-979.
Alexandros Gerbessiotis. 2010. "Parallel option price valuations with the explicit finite difference method." International Journal of Parallel Programming, Springer, vol. 38, no. 2, pp. 159-182.
Srinivasan M Iyer, Marvin K. Nakayama, Alexandros Gerbessiotis. 2009. "A Markovian Dependability Model With Cascading Failures." IEEE Transaction on Computers, vol. 58, no. 9, pp. 1238-1249.
Alexandros Gerbessiotis. 2015. "Extending the BSP model for multi-core and out-of-core computing: MBSP." Elsevier, vol. 41, no. 1, pp. 90-102.
Alexandros Gerbessiotis, Siniolakis Constantinos J. 2014. "A randomized sorting algorithm on the BSP model." Discrete Mathematics, Algorithms and Applications, vol. 6, no. 4, pp. 42.
Alexandros Gerbessiotis. 2012. "An improved reliability bound of a probabilistic parallel integer sorting algorithm." Elsevier, vol. 112, no. 34, pp. 976-979.
Alexandros Gerbessiotis. 2010. "Parallel option price valuations with the explicit finite difference method." International Journal of Parallel Programming, Springer, vol. 38, no. 2, pp. 159-182.
Srinivasan M Iyer, Marvin K. Nakayama, Alexandros Gerbessiotis. 2009. "A Markovian Dependability Model With Cascading Failures." IEEE Transaction on Computers, vol. 58, no. 9, pp. 1238-1249.
Manuscript
“Using parallelism techniques to improve sequential and multi-core sorting performance”
August, 2016.
“BSP Sorting: An experimental Study”
ArxiV.org, August, 2014.
August, 2016.
“BSP Sorting: An experimental Study”
ArxiV.org, August, 2014.