Name
Abstract | ||
|---|---|---|
The 0-1 Principle of Knuth and its many variants are well-known in the context of comparator networks. However, the comparator
model is not the strongest model of computation obeying such principles. This paper studies another natural model of computation,
the Min-Max model, that obeys all known 0-1 Principles. More important, it is the strongest model obeying certain variants
of the 0-1 Principle. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00224-010-9257-8 | Theory of Computing Systems |
Keywords | Field | DocType |
Zero-one principle,Comparator networks,Sorting networks,Min max networks,Oblivious algorithms | Sorting network,Comparator,Theoretical computer science,Model of computation,Mathematics | Journal |
Volume | Issue | ISSN |
48 | 2 | 1432-4350 |
Citations | PageRank | References |
3 | 0.48 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamir Levi | 1 | 9 | 1.85 |
| Ami Litman | 2 | 240 | 49.78 |