Generating pseudo-random permutations and maximum flow algorithms (Q915489): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A Fast and Simple Algorithm for the Maximum Flow Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved Time Bounds for the Maximum Flow Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scaling algorithms for network problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A new approach to the maximum-flow problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A data structure for dynamic trees / rank | |||
Normal rank | |||
Latest revision as of 08:32, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating pseudo-random permutations and maximum flow algorithms |
scientific article |
Statements
Generating pseudo-random permutations and maximum flow algorithms (English)
0 references
1990
0 references
design of algorithms
0 references
derandomization
0 references
pseudo-random permutations
0 references
longest common ascending subsequence
0 references
randomized maximum-flow algorithm
0 references
