Výsledky vyhľadávania - "Nonnumerical Algorithms and Problems General Terms Theory"

On obstruction-free transactions

Autori: Rachid Guerraoui Michał Kapałka The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Rachid Guerraoui Michał Kapałka The Pennsylvania State University CiteSeerX Archives

Zdroj: http://infoscience.epfl.ch/record/120526/files/fp097-guerraoui.pdf.

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Algorithms Keywords Transactional memory, obstruction-freedom, consensus number

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.2957

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.2957
http://infoscience.epfl.ch/record/120526/files/fp097-guerraoui.pdf

Wherefore Art Thou R3579X? Anonymized Social Networks, Hidden Patterns, and Structural Steganography

Autori: Lars Backstrom Cynthia Dwork Jon Kleinberg a ďalší

Prispievatelia: Lars Backstrom Cynthia Dwork Jon Kleinberg a ďalší

Zdroj: http://cs-people.bu.edu/evimaria/cs591/steganography.pdf.

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Measurement Keywords social networks, anonymization

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.7193

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.7193
http://cs-people.bu.edu/evimaria/cs591/steganography.pdf

Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography

Autori: Lars Backstrom Cynthia Dwork Jon Kleinberg a ďalší

Prispievatelia: Lars Backstrom Cynthia Dwork Jon Kleinberg a ďalší

Zdroj: http://cs.ucsb.edu/~suri/cs231/Rlist/anon.pdf.

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Measurement Keywords social networks, anonymization

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.8627; http://cs.ucsb.edu/~suri/cs231/Rlist/anon.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.8627
http://cs.ucsb.edu/~suri/cs231/Rlist/anon.pdf

ABSTRACT An Ω(n log n) Lower Bound on the Cost of Mutual Exclusion

Autori: Rui Fan The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Rui Fan The Pennsylvania State University CiteSeerX Archives

Zdroj: http://theory.csail.mit.edu/tds/papers/Fan/podc06.pdf.

Predmety: F.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms Theory, Algorithms Keywords Mutual exclusion, Time complexity, Lower bound techniques

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1189; http://theory.csail.mit.edu/tds/papers/Fan/podc06.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.1189
http://theory.csail.mit.edu/tds/papers/Fan/podc06.pdf