Randomizing combinatorial algorithms for linear programming when the dimension is moderately high

Marco Pellegrini. Randomizing combinatorial algorithms for linear programming when the dimension is moderately high. In SODA. pages 101-108, 2001. [doi]

@inproceedings{Pellegrini01,
  title = {Randomizing combinatorial algorithms for linear programming when the dimension is moderately high},
  author = {Marco Pellegrini},
  year = {2001},
  doi = {10.1145/365411.365425},
  url = {http://doi.acm.org/10.1145/365411.365425},
  tags = {programming},
  researchr = {https://researchr.org/publication/Pellegrini01},
  cites = {0},
  citedby = {0},
  pages = {101-108},
  booktitle = {SODA},
}