Alexandros V. Gerbessiotis

According to our database1, Alexandros V. Gerbessiotis
  • authored at least 37 papers between 1992 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Integer sorting on multicores: some (experiments and) observations.
CoRR, 2017

2016
Using parallelism techniques to improve sequential and multi-core sorting performance.
CoRR, 2016

2015
Extending the BSP model for multi-core and out-of-core computing: MBSP.
Parallel Computing, 2015

2014
A randomized sorting algorithm on the BSP model.
Discrete Math., Alg. and Appl., 2014

BSP Sorting: An experimental Study.
CoRR, 2014

2012
An improved reliability bound of a probabilistic parallel integer sorting algorithm.
Inf. Process. Lett., 2012

2010
Parallel Option Price Valuations with the Explicit Finite Difference Method.
International Journal of Parallel Programming, 2010

2009
A Markovian Dependability Model with Cascading Failures.
IEEE Trans. Computers, 2009

2007
Coprocessor design to support MPI primitives in configurable multiprocessors.
Integration, 2007

2006
An architecture independent study of parallel segment trees.
J. Discrete Algorithms, 2006

2005
A probabilistic analysis of the Floyd-Rivest expected time selection algorithm.
Int. J. Comput. Math., 2005

2004
Remote memory access: A case for portable, efficient and library independent parallel programming.
Scientific Programming, 2004

Architecture independent parallel binomial tree option price valuations.
Parallel Computing, 2004

Probabilistic integer sorting.
Inf. Process. Lett., 2004

2003
Architecture independent parallel selection with applications to parallel priority queues.
Theor. Comput. Sci., 2003

Trinomial-tree Based Parallel Option Price Valuations.
Parallel Algorithms Appl., 2003

Randomized selection in n+C+o(n) comparisons.
Inf. Process. Lett., 2003

Random Graphs in a Neural Computation Model.
Int. J. Comput. Math., 2003

Increasing the Efficiency of Existing Sorting Algorithms by Using Randomized Wrappers.
Comput. J., 2003

2002
Architecture independent parallel algorithm design: theory vs practice.
Future Generation Comp. Syst., 2002

Parallel Priority Queue and List Contraction: The BSP Approach.
Computers and Artificial Intelligence, 2002

2001
Merging on the BSP model.
Parallel Computing, 2001

1999
Efficient Deterministic Sorting on the BSP Model.
Parallel Processing Letters, 1999

1998
Ordered h-Level Graphs on the BSP Model.
J. Parallel Distrib. Comput., 1998

Practical Considerations of Parallel Simulations and Architecture Independent Parallel Algorithm Design.
J. Parallel Distrib. Comput., 1998

A Graph-theoretic Result for a Model of Neural Computation.
Discrete Applied Mathematics, 1998

An experimental study of BSP sorting algorithms.
PDP, 1998

PRAM programming: theory vs. practice.
PDP, 1998

1997
A Randomized Sorting Algorithm on the BSP model.
Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Parallel Priority Queue and List Contraction: The BSP Approach.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Deterministic Sorting and Randomized Median Finding on the BSP Model.
SPAA, 1996

Selection on the Bulk-Synchronous Parallel Model with Applications to Priority Queues.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1996

Communication Efficient Data Structures on the BSP Model with Applications in Computational Geometry.
Proceedings of the Euro-Par '96 Parallel Processing, 1996

1995
Close-to-optimal and Near-optimal Broadcasting in Random Graphs.
Discrete Applied Mathematics, 1995

1994
Direct Bulk-Synchronous Parallel Algorithms.
J. Parallel Distrib. Comput., 1994

Broadcasting in random graphs.
Discrete Applied Mathematics, 1994

1992
Direct Bulk-Synchronous Parallel Algorithms.
Proceedings of the Algorithm Theory, 1992


  Loading...