FAQ

Unrolled linked list

In computer programming, an unrolled linked list is a variation on the linked list which stores multiple elements in each node. It can dramatically… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2017
01219942017

Related topics

Related topics

11 relations
Array data structureB-treeCDR codingCPU cache
(More)

Related mentions per year

Related mentions per year

1938-2018
19401960198020002020
Unrolled linked list
CPU cache
Array data structure
B-tree
Linked list
Cache-oblivious algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Generic Low-Latency Masking in Hardware
In this work, we introduce a generalized concept for low-latency masking that is applicable to any implementation and protection… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
Energy Efficient Loop Unrolling for Low-Cost FPGAs
Many FPGA computations, including block ciphers, require repetitive loop operations that are difficult to parallelize. Sequential… (More)
  • figure 1.1
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
Is this relevant?
2017
2017
A simple RNN-plus-highway network for statistical parametric speech synthesis
In this report, we proposes a neural network structure that combines a recurrent neural network (RNN) and a deep highway network… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
2014
2014
Practical Concurrent Unrolled Linked Lists Using Lazy Synchronization
Linked lists and other list-based sets are one of the most ubiquitous data structures in computer science. They are useful in… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Particle-in-cell simulation of collisional plasmas using multi-processor architectures
The low-temperature plasma physics community often employs particle-in-cell simulation in conjunction with Monte Carlo collisions… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Review
2008
Review
2008
Statistical Evaluation of a Self-Tuning Vectorized Library for the Walsh–Hadamard Transform
Short vector instructions (SIMD) can significantly increase performance, yet are difficult to use effectively. Recently, several… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
Equivalence of Call-By-Name and Call-By-Need for Lambda-Calculi with Letrec
We develop a proof method to show that in a (deterministic) lambda calculus with letrec and equipped with contextual equivalence… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
Dynamic Currency Determination in Optimized Programs
Compiler optimizations pose many problems to source-level debugging of an optimized program due to reordering, insertion, and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Review
1994
Review
1994
An Event Abstraction Tool : Theory , Design
event. In reality, however, the partner events of a synchronous communication occur in di erent processes and therefore we might… (More)
  • figure 12
Is this relevant?