<--- Back to Details
First PageDocument Content
Sorting algorithms / Combinatorics / Probabilistic complexity theory / Permutations / Quicksort / Randomized algorithm / Algorithm / Fisher–Yates shuffle / Merge sort / Mathematics / Theoretical computer science / Analysis of algorithms
Date: 2014-12-28 09:02:31
Sorting algorithms
Combinatorics
Probabilistic complexity theory
Permutations
Quicksort
Randomized algorithm
Algorithm
Fisher–Yates shuffle
Merge sort
Mathematics
Theoretical computer science
Analysis of algorithms

Add to Reading List

Source URL: web.engr.illinois.edu

Download Document from Source Website

File Size: 218,36 KB

Share Document on Facebook

Similar Documents

Probability / Probabilistic complexity theory / Probability theory / PRISM model checker / Software / Sample space / Model checking / Stochastic process / Randomized algorithm

Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014

DocID: 1rrqu - View Document

Mathematics / Graph theory / Computational complexity theory / Approximation algorithm / Randomized algorithm / Networks / Graphical models / Centrality / Belief propagation

Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-Soriano

DocID: 1riqm - View Document

Online algorithms / Analysis of algorithms / Computer science / Applied mathematics / Computer programming / K-server problem / Metrical task system / Adversary model / Competitive analysis / List update problem / Algorithm / Randomized algorithm

Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately

DocID: 1ri9G - View Document

Graph theory / Planar graph / Randomized algorithm

Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear h

DocID: 1rhdY - View Document

Markov models / Probability theory / Statistics / Probability / Probabilistic complexity theory / Markov processes / Statistical models / Graph theory / Markov chain / Randomized algorithm / Stochastic process / Algorithm

Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By

DocID: 1rdMz - View Document