Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Journal of Experimental Algorithmics
ACM Press
 
   
 
Options:
 
  1-10 of 26 reviews Date Reviewed 
   BlockQuicksort: avoiding branch mispredictions in Quicksort
Edelkamp S., Weiß A.  Journal of Experimental Algorithmics 24(1): 1-22, 2019. Type: Article

Quite often algorithms with bad worst-case complexity perform better on the average. Quicksort falls into this class. However, one of the drawbacks of Quicksort is that it is vulnerable to branch mispredictions, that is, branch misses. Modern proc...

Apr 1 2022
  Practical minimum cut algorithms
Henzinger M., Noe A., Schulz C., Strash D.  Journal of Experimental Algorithmics 231-8, 2018. Type: Article

Due to the ever-increasing deployment of graph theory in natural and artificial phenomena, it is challenging for scientists to utilize it in a more performant manner. One of the most popular topics in graph and networking theory, the authors try t...

Jul 10 2019
  Computing the expected value and variance of geometric measures
Tsirogiannis C., Staals F., Pellissier V.  Journal of Experimental Algorithmics 23(2): 1-32, 2018. Type: Article

Do species that inhabit a certain area form an ecosystem or are they a random collection? To answer this question, ecologists select appropriate numerical characteristics: average body mass, body length, and so on. Each species is described by a p...

Nov 9 2018
  Compact flow diagrams for state sequences
Buchin K., Buchin M., Gudmundsson J., Horton M., Sijben S.  Journal of Experimental Algorithmics 221-23, 2017. Type: Article

Identifying the right algorithm for a specific problem has been a daunting task lately. This is because different problems present different levels of complexity. It is therefore important to identify the complexity of the problem and to divide th...

May 31 2018
  Space-efficient parallel construction of succinct representations of suffix tree topologies
Baier U., Beller T., Ohlebusch E.  Journal of Experimental Algorithmics 22(1): 1-26, 2017. Type: Article

A suffix tree is a compressed tree that represents all the suffixes of a given string. Such a data structure has wide applications in string processing, bioinformatics, and information retrieval and can be constructed with space/time complexity li...

Jan 24 2018
  Faster compressed suffix trees for repetitive collections
Navarro G., Ordóñez Pereira A.  Journal of Experimental Algorithmics 21(1): 1-38, 2016. Type: Article

The suffix tree is a celebrated data structure in stringology and is used in providing efficient solutions for a plethora of problems. The main problem of suffix trees is their space usage: they may even require 20 bytes per text symbol! One solut...

May 9 2016
  Experiments on density-constrained graph clustering
Görke R., Kappes A., Wagner D.  Journal of Experimental Algorithmics 191.1-1.31, 2015. Type: Article

Graph clustering is the task of identifying dense sub-graphs of a given graph such that these sub-graphs are sparsely interconnected. In this paper, the authors conduct an experimental evaluation of greedy graph clustering algorithms. First, the p...

Sep 8 2015
  On a model of virtual address translation
Jurkiewicz T., Mehlhorn K.  Journal of Experimental Algorithmics 191.1-1.28, 2014. Type: Article

The standard random access model (RAM) of memory used in many analyses of algorithmic time complexity does not take into account the structure of modern hierarchical memories. Aggarwal and Vitter’s external memory (EM) model [1] was a first ...

Apr 16 2015
  Efficient matching for column intersection graphs
Auer B., Bisseling R.  Journal of Experimental Algorithmics 191.1-1.22, 2014. Type: Article

Graph partitioning and hypergraph partitioning have been used extensively in applications ranging from very-large-scale integration (VLSI) to portioning of data in parallel and distributed applications. Hypergraph and graph partitioning problems a...

Jul 30 2014
  Data structures resilient to memory faults: an experimental study of dictionaries
Ferraro-Petrillo U., Grandoni F., Italiano G.  Journal of Experimental Algorithmics 181.1-1.14, 2013. Type: Article

Soft errors in electronics equipment can be caused by alpha particles or noise, and can change data that is being processed. The chance of these errors occuring increases with the size and speed of the memory used by the component. Memory cells ca...

Dec 27 2013
 
 
 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy