Non-Interfering Concurrent Exchange (NICE) Networks

08/09/2018
by   Alan W. Paeth, et al.
0

In studying the statistical frequency of exchange in comparison-exchange (CE) networks we discover a new elementary form of comparison-exchange which we name the "2-op". The operation supports concurrent and non-interfering operations of two traditional CEs upon one shared element. More than merely improving overall statistical performance, the introduction of NICE (non-interfering CE) networks lowers long-held bounds in the number of stages required for sorting tasks. Code-based CEs also benefit from improved average/worst case run time costs.

READ FULL TEXT
research
10/31/2017

Proceedings of the Data For Good Exchange 2017

These are the proceedings of the Data For Good Exchange 2017, which was ...
research
06/01/2021

A mixed-frequency approach for exchange rates predictions

Selecting an appropriate statistical model to forecast exchange rates is...
research
02/03/2018

Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach

We add to intuitionistic logic infinitely many classical disjunctive tau...
research
08/10/2020

Concurrent Fixed-Size Allocation and Free in Constant Time

Our goal is to efficiently solve the dynamic memory allocation problem i...
research
03/09/2022

Quantifying Grover speed-ups beyond asymptotic analysis

The usual method for studying run-times of quantum algorithms is via an ...
research
12/31/2022

Wealth Redistribution and Mutual Aid: Comparison using Equivalent/Nonequivalent Exchange Models of Econophysics

Given the wealth inequality worldwide, there is an urgent need to identi...
research
03/15/2018

Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort

QuickXSort is a strategy to combine Quicksort with another sorting metho...

Please sign up or login with your details

Forgot password? Click here to reset