High-Dimensional Screening Using Multiple Grouping of VariablesVATS, Divyanshu.IEEE transactions on signal processing. 2014, Vol 62, Num 1-4, pp 694-702, issn 1053-587X, 9 p.Article

On randomized algorithms for the majority problemCHRISTOFIDES, Demetres.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1481-1485, issn 0166-218X, 5 p.Article

Variationally universal hashingKROVETZ, Ted; ROGAWAY, Phillip.Information processing letters. 2006, Vol 100, Num 1, pp 36-39, issn 0020-0190, 4 p.Article

Ski rental with two general optionsLOTKER, Zvi; PATT-SHAMIR, Boaz; RAWITZ, Dror et al.Information processing letters. 2008, Vol 108, Num 6, pp 365-368, issn 0020-0190, 4 p.Article

Fair service for mice in the presence of elephantsVOORHIES, Seth; LEE, Hyunyoung; KLAPPENECKER, Andreas et al.Information processing letters. 2006, Vol 99, Num 3, pp 96-101, issn 0020-0190, 6 p.Article

On the relationship between ε-biased random variables and ε-dependent random variablesJIMBO, S; MARUOKA, A.Information processing letters. 1994, Vol 51, Num 1, pp 17-23, issn 0020-0190Article

Randomized strategies for the plurality problemKRAL, Daniel; SGALL, Jiri; TICHY, Tomas et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3305-3311, issn 0166-218X, 7 p.Conference Paper

The Fractional Congestion Bound for Efficient Edge Disjoint RoutingBAVEJA, Alok.Networks (New York, NY). 2008, Vol 51, Num 3, pp 190-199, issn 0028-3045, 10 p.Article

A randomized algorithm for gossiping in radio networksCHROBAK, Marek; GASIENIEC, Leszek; RYTTER, Woiciech et al.Networks (New York, NY). 2004, Vol 43, Num 2, pp 119-124, issn 0028-3045, 6 p.Article

SAGA 2003 : stochastic algorithms : foundations and applications (Hatfield, 22-23 September 2003)Albrecht, Andreas; Steinhöfel, Kathleen.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20103-3, VIII, 166 p, isbn 3-540-20103-3Conference Proceedings

RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMSCHEN, Jianer; KNEIS, Joachim; LU, Songjian et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2526-2547, issn 0097-5397, 22 p.Article

Fast algorithms for approximately counting mismatchesKARLOFF, H.Information processing letters. 1993, Vol 48, Num 2, pp 53-60, issn 0020-0190Article

Minimizing the total completion time on-line on a single machine, using restartsVAN STEE, Rob; LA PCUTRE, Han.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 95-129, issn 0196-6774, 35 p.Article

Pseudorandom generators for space-bounded computationNISAN, N.Combinatorica (Print). 1992, Vol 12, Num 4, pp 449-461, issn 0209-9683Article

Efficient sampling strategy and refinement strategy for randomized circle detectionCHUNG, Kuo-Liang; HUANG, Yong-Huai; SHEN, Shi-Ming et al.Pattern recognition. 2012, Vol 45, Num 1, pp 252-263, issn 0031-3203, 12 p.Article

Efficient polynomial time algorithms computing industrial-strength primitive rootsDUBROIS, Jacques; DUMAS, Jean-Guillaume.Information processing letters. 2006, Vol 97, Num 2, pp 41-45, issn 0020-0190, 5 p.Article

Research on probabilistic methods for control system designCALAFIORE, Giuseppe C; DABBENE, Fabrizio; TEMPO, Roberto et al.Automatica (Oxford). 2011, Vol 47, Num 7, pp 1279-1293, issn 0005-1098, 15 p.Article

A randomized approximation algorithm for computing bucket ordersUKKONEN, Antti; PUOLAMAKI, Kai; GIONIS, Aristides et al.Information processing letters. 2009, Vol 109, Num 7, pp 356-359, issn 0020-0190, 4 p.Article

Resource-bounded measure on probabilistic classesMOSER, Philippe.Information processing letters. 2008, Vol 106, Num 6, pp 241-245, issn 0020-0190, 5 p.Article

Speed up the computation of randomized algorithms for detecting lines, circles, and ellipses using novel tuning-and LUT-based voting platformCHUNG, Kuo-Liang; HUANG, Yong-Huai.Applied mathematics and computation. 2007, Vol 190, Num 1, pp 132-149, issn 0096-3003, 18 p.Article

Monte carlo and las vegas randomized algorithms for systems and control : An introductionTEMPO, Roberto; ISHII, Hideaki.European journal of control. 2007, Vol 13, Num 2-3, pp 189-203, issn 0947-3580, 15 p.Conference Paper

FFT-based algorithms for the string matching with mismatches problemSCHOENMEYR, Tor; ZHANG, David Yu.Journal of algorithms (Print). 2005, Vol 57, Num 2, pp 130-139, issn 0196-6774, 10 p.Article

Teaching randomized learners with feedbackBALBACH, Frank J; ZEUGMANN, Thomas.Information and computation (Print). 2011, Vol 209, Num 3, pp 296-319, issn 0890-5401, 24 p.Conference Paper

Probabilistic sorting and stabilization of switched systemsISHII, Hideaki; TEMPO, Roberto.Automatica (Oxford). 2009, Vol 45, Num 3, pp 776-782, issn 0005-1098, 7 p.Article

An improvement of the tree code constructionPECZARSKI, Marcin.Information processing letters. 2006, Vol 99, Num 3, pp 92-95, issn 0020-0190, 4 p.Article