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

Algorithms ◽  
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.

scholarly journals Preface

2019 ◽  
Vol 28 (4) ◽  
pp. 483-484
Author(s):  
Hsien-Kuei Hwang ◽  
Ralph Neininger ◽  
Marek Zaionc
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Probabilistic Methods ◽  
Algorithms And Data Structures ◽  
Special Issue ◽  
Rich Variety ◽  
Cost Distribution ◽  
Discrete Structures ◽  
Measure Of Performance ◽  
The Cost

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.

scholarly journals Special Issue on Algorithms and Data Structures (WADS 2019)

Algorithmica ◽  
2021 ◽  
Vol 83 (3) ◽  
pp. 775-775
Author(s):  
Zachary Friggstad ◽  
Jörg-Rüdiger Sack ◽  
Mohammad R. Salavatipour
Keyword(s):  
Data Structures ◽  
Algorithms And Data Structures ◽  
Special Issue

scholarly journals Algorithms and Data Structures for Sparse Polynomial Arithmetic

Mathematics ◽  
2019 ◽  
Vol 7 (5) ◽  
pp. 441 ◽  
Author(s):  
Mohammadali Asadi ◽  
Alexander Brandt ◽  
Robert H. C. Moir ◽  
Marc Moreno Maza
Keyword(s):  
Data Structures ◽  
High Performance ◽  
Polynomial Algebra ◽  
Rational Numbers ◽  
Algorithms And Data Structures ◽  
Multivariate Polynomial ◽  
Memory Hierarchies ◽  
Sparse Polynomial ◽  
Implementation Techniques ◽  
Division With Remainder

We provide a comprehensive presentation of algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers as implemented in the freely available Basic Polynomial Algebra Subprograms (BPAS) library. We report on an algorithm for sparse pseudo-division, based on the algorithms for division with remainder, multiplication, and addition, which are also examined herein. The pseudo-division and division with remainder operations are extended to multi-divisor pseudo-division and normal form algorithms, respectively, where the divisor set is assumed to form a triangular set. Our operations make use of two data structures for sparse distributed polynomials and sparse recursively viewed polynomials, with a keen focus on locality and memory usage for optimized performance on modern memory hierarchies. Experimentation shows that these new implementations compare favorably against competing implementations, performing between a factor of 3 better (for multiplication over the integers) to more than 4 orders of magnitude better (for pseudo-division with respect to a triangular set).

scholarly journals Advances in the Molecular Mechanisms of Abscisic Acid and Gibberellins Functions in Plants

2021 ◽  
Vol 22 (11) ◽  
pp. 6080
Author(s):  
Víctor Quesada
Keyword(s):  
Abscisic Acid ◽  
Molecular Mechanisms ◽  
Original Research ◽  
Special Issue ◽  
Research Papers

In this special issue entitled, “Advances in the Molecular Mechanisms of Abscisic Acid and Gibberellins Functions in Plants”, eight articles are collected, with five reviews and three original research papers, which broadly cover different topics on the abscisic acid (ABA) field and, to a lesser extent, on gibberellins (GAs) research [...]

Sign in / Sign up

Export Citation Format

Share Document