Výsledky vyhledávání - "Nonnumerical Algorithms and Problems General Terms Theory"

On obstruction-free transactions

Autoři: Rachid Guerraoui Michał Kapałka The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Rachid Guerraoui Michał Kapałka The Pennsylvania State University CiteSeerX Archives

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

Témata: 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 souboru: application/pdf

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

Dostupnost: 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

Autoři: Lars Backstrom Cynthia Dwork Jon Kleinberg a další

Přispěvatelé: Lars Backstrom Cynthia Dwork Jon Kleinberg a další

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

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

Popis souboru: application/pdf

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

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

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

Autoři: Rui Fan The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Rui Fan The Pennsylvania State University CiteSeerX Archives

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

Témata: 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 souboru: 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

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

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.

Autoři: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN a další

Zdroj: Journal of the ACM; Feb2015, Vol. 62 Issue 1, p1-22, 22p

Témata: COMPUTER programming, DISTRIBUTED databases, ALGORITHMS, POLYNOMIALS, ALGEBRA

The Cost of Fault Tolerance in Multi-Party Communication Complexity.

Autoři: BINBIN CHEN HAIFENG YU YUDA ZHAO a další

Zdroj: Journal of the ACM; May2014, Vol. 61 Issue 3, p19:1-19:64, 64p

Témata: FAULT-tolerant computing, COMMUNICATION complexity (Information theory), DISTRIBUTED computing, LOGARITHMIC functions, AD hoc computer networks

Tight Bounds for Asynchronous Renaming.

Autoři: ALISTARH, DAN ASPNES, JAMES CENSOR-HILLEL, KEREN a další

Zdroj: Journal of the ACM; May2014, Vol. 61 Issue 3, p18:1-18:51, 51p

Témata: DISTRIBUTED computing, COMPUTATIONAL complexity, NAMESPACE (Computer science), DETERMINISTIC algorithms, LOGARITHMIC functions

A Quantum Lovász Local Lemma.

Autoři: AMBAINIS, ANDRIS KEMPE, JULIA SATTATH, OR

Zdroj: Journal of the ACM; Oct2012, Vol. 59 Issue 5, Special section p24-24, 24p

Témata: VECTOR spaces, PROBABILITY theory, VECTOR analysis, QUANTUM computers, MATHEMATICS, QUANTUM theory

Breaking the O(n²) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary.

Zdroj: Journal of the ACM; Jul2011, Vol. 58 Issue 4, p18:1-18:24, 24p

Témata: PEER-to-peer architecture (Computer networks), ALGORITHMS, DISTRIBUTED computing, MONTE Carlo method, COMPUTER science

Time Lower Bounds for Implementations of Multi-Writer Snapshots.

Autoři: Ellen, Faith Fatourou, Panagiota Ruppert, Eric

Zdroj: Journal of the ACM; Dec2007, Vol. 54 Issue 6, p1-34, 34p, 5 Diagrams, 1 Chart

Témata: ALGORITHMS, DISTRIBUTED computing, DATA structures, REGISTERS (Computers), COMPUTER storage devices, COMPUTER networks

A New Average Case Analysis for Completion Time Scheduling.

Autoři: Scharbrodt, Mark Schickinger, Thomas Steger, Angelika

Zdroj: Journal of the ACM; Jan2006, Vol. 53 Issue 1, p121-146, 26p

Témata: PRODUCTION scheduling, MACHINERY, DISTRIBUTION (Probability theory), PROBABILITY theory, MANAGEMENT

Greedy Algorithms Make Efficient Mechanisms.

Autoři: LUCIER, BRENDAN SYRGKANIS, VASILIS

Zdroj: EC: Economics & Computation; 2015, p221-238, 18p

Témata: GREEDY algorithms, AUCTIONS, MATHEMATICAL models, MATROIDS, INTERNET advertising, PRICING

Truthful Mechanisms with Implicit Payment Computation.

Autoři: Babaioff, Moshe Kleinbergy, Robert D. Slivkins, Aleksandrs

Zdroj: EC: Electronic Commerce; 2010, p43-52, 10p

Témata: AUCTIONS, BIDDING strategies, BIDDERS, PAYMENT, ALGORITHMS, MANAGEMENT

Distributed Selfish Load Balancing on Networks.

Autoři: BERENBRINK, PETRA HOEFER, MARTIN SAUERWALD, THOMAS

Zdroj: ACM Transactions on Algorithms; Jul2014, Vol. 11 Issue 1, p1-29, 29p

Témata: LOAD balancing (Computer networks), WORKLOAD of computer networks, DISTRIBUTED computing, NASH equilibrium, STOCHASTIC convergence, ALGORITHMS

Nonuniform Boolean Constraint Satisfaction Problems with Cardinality Constraint.

Autoři: Creignou, Nadia Schnoor, Henning Schnoor, Ilka

Zdroj: ACM Transactions on Computational Logic; Jul2010, Vol. 11 Issue 4, p24:1-24:32, 32p, 1 Diagram, 1 Chart

Témata: BOOLEAN algebra, GALOIS theory, CARDINAL numbers, MATHEMATICAL optimization, MATHEMATICS education

Fast Asynchronous Byzantine Agreement and Leader Election with Full Information.

Autoři: KAPRON, BRUCE M. KEMPE, DAVID KING, VALERIE a další

Zdroj: ACM Transactions on Algorithms; 2010, Vol. 6 Issue 4, p68:1-68:28, 28p, 1 Diagram

Témata: INFORMATION modeling, COMPUTER network protocols, PROBABILITY theory, SYSTEM analysis, MONTE Carlo method

A 1.8 Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2.

Autoři: EVEN, GUY FELDMAN, JON KORTSARZ, GUY a další

Zdroj: ACM Transactions on Algorithms; 2009, Vol. 5 Issue 2, p21-21:17, 17p, 2 Diagrams

Témata: GRAPH connectivity, GRAPH theory, ALGORITHMS, APPROXIMATION theory, MACHINE theory

Information Asymmetries in Common-Value Auctions with Discrete Signals [extended abstract].

Autoři: SYRGKANIS, VASILIS KEMPE, DAVID TARDOS, EVA

Zdroj: EC: Economics & Computation; 2015, p303-303, 1p

Témata: AUCTIONS, BIDDERS, ECONOMIC equilibrium