A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
The Streaming Complexity of Cycle Counting, Sorting By Reversals, and Other Problems
[chapter]

2011
*
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms
*

*By*designing reductions from BHH, we prove lower bounds for

*the*

*streaming*

*complexity*

*of*approximating

*the*

*sorting*

*by*

*reversal*distance,

*of*approximately

*counting*

*the*number

*of*

*cycles*in a 2-regular graph ... ,

*and*

*of*

*other*

*problems*. ...

*problem*,

*and*for a lot

*of*encouragement along

*the*way. ...

##
###
Working with Unix Tools

2005
*
IEEE Software
*

Surprisingly, many

doi:10.1109/ms.2005.170
fatcat:n7axbyuzgbd73dguynla6j455a
*problems*involve simply*counting**the*processing step's output using*the*humble wc (word*count*) command*and*its -l (*count*lines) flag. ...*The**sort*command supports tens*of*options for specifying*the**sort*keys, their type,*and**the*output order. Having your results*sorted*, you could then*count*how many instances*of*each element you have. ...##
###
New conceptual model of Reverse Logistics of a worldwide Fashion Company

2020
*
Procedia Manufacturing
*

*The*main goal

*of*this study is to address

*and*analyze

*the*current business

*and*process model used

*by*

*the*Portuguese 3PL, to compare it with

*other*existing models within

*the*state-

*of*-art,

*and*to design ...

*The*main goal

*of*this study is to address

*and*analyze

*the*current business

*and*process model used

*by*

*the*Portuguese 3PL, to compare it with

*other*existing models within

*the*state-

*of*-art,

*and*to design ... Due to

*the*

*complexity*

*and*long duration

*of*some processes,

*the*need to categorize

*the*relevant activities

*of*each process arose, in order to ease

*the*

*cycle*time measurement. ...

##
###
Duality Between Prefetching and Queued Writing with Parallel Disks

2005
*
SIAM journal on computing (Print)
*

This

doi:10.1137/s0097539703431573
fatcat:tskw3fqffzauzbq5ym3fvq4u7y
*problem*can be mitigated*by*using multiple disks in parallel. For each input/output operation, one block is transferred between a fast memory*of*size M*and*each*of**the*D disks. ... To combat this*problem*, we define a useful*and*natural duality between writing to parallel disks*and**the*seemingly more difficult*problem**of*prefetching. ... Mitra, Nitin Rajput, Erhard Rahm,*and*Berthold Vöcking for valuable discussions. Anonymous referees have given detailed feedback that helped to improve*the*readability*of**the*paper. ...##
###
Duality between Prefetching and Queued Writing with Parallel Disks
[chapter]

2001
*
Lecture Notes in Computer Science
*

This

doi:10.1007/3-540-44676-1_5
fatcat:o674cwdv3jg4lgqkojs5snnq34
*problem*can be mitigated*by*using multiple disks in parallel. For each input/output operation, one block is transferred between a fast memory*of*size M*and*each*of**the*D disks. ... To combat this*problem*, we define a useful*and*natural duality between writing to parallel disks*and**the*seemingly more difficult*problem**of*prefetching. ... Mitra, Nitin Rajput, Erhard Rahm,*and*Berthold Vöcking for valuable discussions. Anonymous referees have given detailed feedback that helped to improve*the*readability*of**the*paper. ...##
###
A structural analysis of the A5/1 state transition graph

2012
*
Electronic Proceedings in Theoretical Computer Science
*

We describe efficient algorithms to analyze

doi:10.4204/eptcs.99.4
fatcat:mreuyspslrhi5pbaqdwp6pjnjy
*the**cycle*structure*of**the*graph induced*by**the*state transition function*of**the*A5/1*stream*cipher used in GSM mobile phones*and*report on*the*results*of**the*...*The*result is a graph containing only*cycles*that can be further analyzed in internal memory to*count**the*number*and*size*of**the**cycles*. ...*The*destination nodes*of**the*edge list (1) are extracted in (2)*and**sorted*ascending*by*(3)*and*(4) . Stage (5) generates a unique destination node*stream*. ...##
###
Parallel Programming for FPGAs
[article]

2018
*
arXiv
*
pre-print

*The*book assumes

*the*reader has a working knowledge

*of*C/C++

*and*includes a significant amount

*of*sample code. ... Our goal is to give

*the*reader an appreciation

*of*

*the*process

*of*creating an optimized hardware design using HLS. ...

*The*Vivado R HLS tool

*counts*

*cycles*

*by*determining

*the*maximum number

*of*registers between any input

*and*output

*of*a task. ...

##
###
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
[chapter]

2009
*
Lecture Notes in Computer Science
*

We present an algorithm for computing BWT directly in linear time

doi:10.1007/978-3-642-03784-9_9
fatcat:xkxkr4omdbbb7gav2yzqqwslvu
*by*modifying*the*suffix array construction algorithm based on induced*sorting*[16] . ... In previous studies to compute BWT directly [6, 13], one constructs BWT incrementally, which requires O(n log n) time where n is*the*length*of**the*input text. ...*The*SAIS algorithm for an input*of*length n requires O(n) time*and**the*time required to solve*the*same*problem**of*half*the*length. Therefore,*the*total time*complexity*is O(n). ...##
###
Energy-Efficient Algorithms

2016
*
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science - ITCS '16
*

We initiate

doi:10.1145/2840728.2840756
dblp:conf/innovations/DemaineLMT16
fatcat:i6r45uh5cfflje2d7hye2f7ic4
*the*systematic study*of**the*energy*complexity**of*algorithms (in addition to time*and*space*complexity*) based on Landauer's Principle in physics, which gives a lower bound on*the*amount*of*energy ... These results lay a theoretical foundation for a new field*of*semi-*reversible*computing*and*provide a new framework for*the*investigation*of*algorithms. ... Acknowledgments We thank Martin Demaine*and*Kevin Kelley for helpful early discussions about this project, in particular early formulations*of**the*models*of*computation. We also thank Maria L. ...##
###
Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma
[article]

2021
*
arXiv
*
pre-print

This result can be

arXiv:2104.04908v1
fatcat:qwoo2lbarbe3hmbpzqyw4n2esa
*of*independent interest*and*useful for*other**streaming*lower bounds as well. ... We study space-pass tradeoffs in graph*streaming*algorithms for parameter estimation*and*property testing*problems*such as estimating*the*size*of*maximum matchings*and*maximum cuts, weight*of*minimum spanning ... Acknowledgement*The*first author is grateful to Gillat Kol, Raghuvansh Saxena,*and*Huacheng Yu, for their previous collaboration in [AKSY20] that was*the*starting point*of*this project,*and*to David ...##
###
PM: a system to support the automatic acquisition of programming knowledge

1990
*
IEEE Transactions on Knowledge and Data Engineering
*

Tambe

doi:10.1109/69.60791
fatcat:rt62psqggncglh4wewbh7nsj3u
*and*Newell have shown that some chunks are more expensive to employ in*the**problem*solving process than*others*[21] . ...*The*role played*by*an aggregate in*the*refinement process is expressed in terms*of**the*data*and*control links between it*and**the**other*aggregates. ... A member*of**the*IEEE Computer Society,*the*Association for Computing Machinery, SIGART,*and*AAAI, his research interests include knowledge engineering, expert systems,*and**the*application*of*artificial ...##
###
McBits: Fast Constant-Time Code-Based Cryptography
[chapter]

2013
*
Lecture Notes in Computer Science
*

For example, at a 2 128 security level, this paper achieves a reciprocal decryption throughput

doi:10.1007/978-3-642-40349-1_15
fatcat:ibgomepn2ragnngm4suiyuihjq
*of*just 60493*cycles*(plus cipher cost etc.) on a single Ivy Bridge core. ... These algorithms rely on an additive FFT for fast root computation, a transposed additive FFT for fast syndrome computation,*and*a*sorting*network to avoid cache-timing attacks. ... It is common to filter out variations in*cycle**counts**by*reporting*the*median*cycle**count*for many computations. ...##
###
Energy-Efficient Algorithms
[article]

2016
*
arXiv
*
pre-print

We initiate

arXiv:1605.08448v1
fatcat:or7pwl5hlvac7cgwl3uq4faltu
*the*systematic study*of**the*energy*complexity**of*algorithms (in addition to time*and*space*complexity*) based on Landauer's Principle in physics, which gives a lower bound on*the*amount*of*energy ... These results lay a theoretical foundation for a new field*of*semi-*reversible*computing*and*provide a new framework for*the*investigation*of*algorithms. ... Acknowledgments We thank Martin Demaine*and*Kevin Kelley for helpful early discussions about this project, in particular early formulations*of**the*models*of*computation. We also thank Maria L. ...##
###
Supporting the hypercube programming model on mesh architectures

1992
*
Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures - SPAA '92
*

A direct implementation

doi:10.1145/140901.140917
dblp:conf/spaa/Stricker92
fatcat:ty7dwp7qgbeafoz5cmxtrabbim
*of**the*embedding is made possible*by*logical channels*and*pathways. ... Our work was motivated*by**the*need for fast library routines to do parallel*sorting*, fast Fouriertransformation*and*processor synchronization. ... I am grateful to all*of*them particularly to Thomas Gross, H.T. Kung, Guy Blelloch*and*Dave O'Hallaron. ...##
###
Dag Realizations of Directed Degree Sequences
[chapter]

2011
*
Lecture Notes in Computer Science
*

*The*

*complexity*status

*of*this

*problem*is open, while a generalization,

*the*f -factor dag

*problem*can be shown to be NPcomplete. ... In this paper, we prove that an important class

*of*sequences,

*the*so-called opposed sequences, admit an O(n + m) realization algorithm, where n

*and*m denote

*the*number

*of*vertices

*and*arcs, respectively ...

*The*authors wish to thank Winfried Hochstättler for many stimulating discussions on this fascinating

*problem*. ...

« Previous

*Showing results 1 — 15 out of 26,192 results*