Stem hypercub$ (all stems)

35 papers:

STOC-2013-ChakrabartyS

A o(n) monotonicity tester for boolean functions over the hypercube (DC, CS), pp. 411–418.

STOC-2013-ChakrabartyS13a #bound #testing

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (DC, CS), pp. 419–428.

ICALP-v1-2013-DinurG #clustering

Clustering in the Boolean Hypercube in a List Decoding Regime (ID, EG), pp. 413–424.

KDD-2011-WilkinsonAN #classification #named #random

CHIRP: a new classifier based on composite hypercubes on iterated random projections (LW, AA, DTN), pp. 6–14.

SAT-2009-ChebiryakWKH #agile

Finding Lean Induced Cycles in Binary Hypercubes (YC, TW, DK, LH), pp. 18–31.

ICALP-v1-2006-Harren #approximate #orthogonal #problem

Approximating the Orthogonal Knapsack Problem for Hypercubes (RH), pp. 238–249.

SAC-2005-MonemizadehS #multi #network #scalability

The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors (MM, HSA), pp. 729–733.

SAC-2004-MinOAK #communication #network

Communication delay in hypercubic networks with LRD traffic (GM, MOK, IUA, DDK), pp. 347–351.

STOC-2003-AdlerHKV #network #peer-to-peer #probability #process

A stochastic process on the hypercube with applications to peer-to-peer networks (MA, EH, RMK, VVV), pp. 575–584.

SAC-2003-MinOF #performance #predict

Performance Prediction of Wormhole Switching in Hypercubes with Bursty Traffic Pattern (GM, MOK, JDF), pp. 985–989.

STOC-2001-Vocking #permutation

Almost optimal permutation routing on hypercubes (BV), pp. 530–539.

SAC-2001-ShahrabiOM #adaptation #analysis

Unicast-based broadcast: an analysis for the hypercube with adaptive routing (AS, MOK, LMM), pp. 489–493.

SAC-2000-Al-Omari #network

Routing in Quad Tree-Hypercube Networks (MAO), pp. 677–681.

SAC-1999-Al-OmariM #fault tolerance #using

Fault-Tolerant Routing in Hypercubes Using Masked Interval Routing Scheme (MAO, MM), pp. 481–485.

SAC-1999-Jenq #parallel

Parallel Polygon Scan Conversion on Hypercube Multiprocessors (JJFJ), pp. 110–114.

SAC-1998-Al-OmariA #algorithm #network

Routing algorithms for tree-hypercube networks (MAO, HAS), pp. 85–89.

SAC-1997-Li97b #on the

On dynamic tree growing in hypercubes (KL), pp. 496–503.

HPCA-1996-ChenL #named

Shuffle-Ring: Overcoming the Increasing Degree of Hypercube (GC, FCML), pp. 130–138.

SAC-1995-AlfantookhGA #architecture #implementation

Implementation of 2-4 finger trees in the hypercube architecture (AA, KMG, HMAH), pp. 198–205.

SAC-1995-JengL #algorithm

Optimal hypercube algorithms for robot configuration space computation (JFFJ, WNL), pp. 182–186.

HPCA-1995-BouraD #modelling

Modeling Virtual Channel Flow Control in Hypercubes (YMB, CRD), pp. 166–175.

ICALP-1994-PlaxtonS #bound #network #sorting

A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks (CGP, TS), pp. 618–629.

HT-1993-Parunak

Hypercubes Grow on Trees (and Other Observations from the Land of Hypersets) (HVDP), pp. 73–81.

SAC-1993-StrateW #algorithm #multi #programming

Load Balancing Techniques for Dynamic Programming Algorithms on Hypercube Multiprocessors (SAS, RLW), pp. 562–569.

SAC-1993-ZhengLP #network

Sparse Hypercube-Like Interconnection Networks (SQZ, SL, EKP), pp. 694–700.

STOC-1992-Plaxton #network #sorting

A Hypercubic Sorting Network with Nearly Logarithmic Depth (CGP), pp. 405–416.

HPDC-1992-AhmadGF #distributed

Allocation of Computations with Dynamic Structures on Hypercube Based Distributed Systems (IA, AG, GF), pp. 228–237.

PPoPP-1991-HatcherLJQA #compilation #multi

A Production-Quality C* Compiler for Hypercube Multicomputers (PJH, AJL, RRJ, MJQ, RJA), pp. 73–82.

STOC-1990-CypherP #sorting

Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers (RC, CGP), pp. 193–203.

STOC-1989-HastadLN #performance #using

Fast Computation Using Faulty Hypercubes (Extended Abstract) (JH, FTL, MN), pp. 251–263.

TAV-1989-ChoiMP #execution #named #scheduling

PMothra: Scheduling Mutants for Execution on a Hypercube (BC, AM, BP), pp. 58–65.

PPEALS-1988-QuinnHJ #compilation #multi #source code

Compiling C* Programs for a Hypercube Multicomputer (MJQ, PJH, KCJ), pp. 57–65.

DAC-1987-JonesB #algorithm #parallel #performance #standard

Performance of a Parallel Algorithm for Standard Cell Placement on the Intel Hypercube (MJ, PB), pp. 807–813.

DAC-1987-OlukotunM #parallel

A Preliminary Investigation into Parallel Routing on a Hypercube Computer (KO, TNM), pp. 814–820.

STOC-1987-HastadLN #configuration management #fault

Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) (JH, FTL, MN), pp. 274–284.