Balancing vectors in the max norm
From MaRDI portal
Recommendations
Cites work
Cited in
(51)- Parallel chip firing games on graphs
- Games on line graphs and sand piles
- The probabilistic method yields deterministic parallel algorithms
- From Erdős to algorithms
- Sandpiles and order structure of integer partitions
- No polynomial bound for the period of the parallel chip firing game on graphs
- Universality of the chip-firing game
- Reroute sequence planning in telecommunication networks and compact vector summation.
- Improved algorithms via approximations of probability distributions
- Selectively balancing unit vectors
- The chip firing game on \(n\)-cycles
- Sand piles models of signed partitions with d piles
- Flow-firing processes
- On the sandpile model of modified wheels. II
- An exact bound on the number of chips of parallel chip-firing games that stabilize
- Eric Goles
- A survey on the stability of (extended) linear Sand Pile model
- Maximal inequalities and their applications to orthogonal and Hadamard matrices
- Chip-firing and energy minimization on M-matrices
- Root system chip-firing. I: Interval-firing
- Balanced partitions of vector sequences
- The chip-firing game
- A note on norms of signed sums of vectors
- Small subset sums
- Dynamic graph models and their properties
- On series of signed vectors and their rearrangements
- On-line balancing of random inputs
- Two sided Sand Piles Model and unimodal sequences
- Quasi‐random 2‐ colorings of point sets
- Sand piles: from physics to cellular automata models
- Three Thresholds for a Liar
- Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
- Balancing sums of random vectors
- Sorting via chip-firing
- Balancing unit vectors
- Sorting via chip-firing
- The structure of a linear chip firing game and related models
- LARGE SIGNED SUBSET SUMS
- Discrepancy theory and related algorithms
- Some statistics about tropical sandpile model
- Ending states of a special variant of the chip-firing algorithm
- Self-reachable configuration polytopes for trees
- Chip-firing on infinite k-ary trees
- Chip-firing games on directed graphs
- Revisit the partial coloring method: prefix spencer and sampling
- Chip firing on directed k-ary trees
- A constant bound for the periods of parallel chip-firing games with many chips
- Balancing Gaussian vectors
- Properties of chip-firing games on complete graphs
- Chip-firing games on graphs
- On the stability of sand piles model
This page was built for publication: Balancing vectors in the max norm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076635)
