Special Issue on Algorithms and Data Structures (WADS 2019)

This special issue is devoted to the Mathematical Analysis of Algorithms, which aims to predict the performance of fundamental algorithms and data structures in general use in Computer Science. The simplest measure of performance is the expected value of a cost function under natural models of randomness for the data, and finer properties of the cost distribution provide a deeper understanding of the complexity. Research in this area, which is intimately connected to combinatorics and random discrete structures, uses a rich variety of combinatorial, analytic and probabilistic methods.

Download Full-text

Advances in Graph Algorithms Special Issue on Selected Papers from the Seventh International Workshop on Algorithms and Data Structures, WADS 2001: Guest Editors' Foreword

Graph Algorithms and Applications 4 ◽

10.1142/9789812773296_0004 ◽

2006 ◽

pp. 101-103

Author(s):

Giuseppe Liotta ◽

Ioannis G. Tollis

Keyword(s):

Data Structures ◽

Graph Algorithms ◽

International Workshop ◽

Algorithms And Data Structures ◽

Special Issue

Download Full-text

Special Issue on “Algorithm Engineering: Towards Practically Efficient Solutions to Combinatorial Problems”

Algorithms ◽

10.3390/a12110229 ◽

2019 ◽

Vol 12 (11) ◽

pp. 229

Author(s):

Mattia D’Emidio ◽

Daniele Frigioni

Keyword(s):

Data Structures ◽

Efficient Solutions ◽

Combinatorial Problems ◽

Algorithm Engineering ◽

Original Research ◽

Algorithms And Data Structures ◽

Special Issue ◽

Methodological Issues ◽

Memory Hierarchies ◽

Discrete Algorithms

The purpose of this special issue of Algorithms was to attract papers presenting original research in the area of algorithm engineering. In particular, submissions concerning the design, analysis, implementation, tuning, and experimental evaluation of discrete algorithms and data structures, and/or addressing methodological issues and standards in algorithmic experimentation were encouraged. Papers dealing with advanced models of computing, including memory hierarchies, cloud architectures, and parallel processing were also welcome. In this regard, we solicited contributions from all most prominent areas of applied algorithmic research, which include but are not limited to graphs, databases, computational geometry, big data, networking, combinatorial aspects of scientific computing, and computational problems in the natural sciences or engineering.

Download Full-text