Výsledky vyhľadávania - "Analysis of algorithms and problem complexity—Nonnumerical Algorithms and Problems General Terms"

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps.

Predmety: graph algorithms, computational geometry, matrix multiplication

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779; http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8779
http://www.cs.uwaterloo.ca/~tmchan/moreapsp_stoc.ps

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Theory

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://distcomp.ethz.ch/publications/dialm05a.ps.

Predmety: routing, mobile network, dynamic graphs

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4183; http://distcomp.ethz.ch/publications/dialm05a.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.4183
http://distcomp.ethz.ch/publications/dialm05a.ps

Optimal-time adaptive strong renaming, with applications to counting

Autori: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

Prispievatelia: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

Zdroj: http://www.cs.yale.edu/homes/aspnes/papers/podc2011-tight-renaming-proceedings.pdf.

Predmety: Categories and Subject Descriptors D.1.3 [Software, Programming Techniques—Concurrent programming, E.1 [Data, Data Structures, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms Alg, Theory Keywords distributed computing, shared memory, renaming, adaptive algorithms, sorting networks, lower bounds

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.1084
http://www.cs.yale.edu/homes/aspnes/papers/podc2011-tight-renaming-proceedings.pdf

Online Auctions and Generalized Secretary Problems. SIGecom Exchange 7

Autori: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

Prispievatelia: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

Zdroj: http://www-rcf.usc.edu/~dkempe/publications/secretarySIG.pdf.

Predmety: Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Online Algorithms, Secretary Problems, Auctions, Knapsack, Matroids

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.7718
http://www-rcf.usc.edu/~dkempe/publications/secretarySIG.pdf

Approximation via Cost Sharing: Simpler and better . . .

Autori: Anupam Gupta Amit Kumar Martin Pál a ďalší

Prispievatelia: Anupam Gupta Amit Kumar Martin Pál a ďalší

Zdroj: http://theory.stanford.edu/~tim/papers/simple.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Approximation algorithms, cost sharing, network design, random sampling

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4736; http://theory.stanford.edu/~tim/papers/simple.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.4736
http://theory.stanford.edu/~tim/papers/simple.pdf

Minimizing Movement

Autori: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a ďalší

Prispievatelia: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a ďalší

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

Predmety: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Motion planning, pebble placement, graphs, Euclidean plane

Popis súboru: application/pdf

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

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

A Validating XML Documents in the Streaming Model with External

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.liafa.jussieu.fr/~magniez/PAPIERS/km-tods.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of algorithms and problem complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.8316
http://www.liafa.jussieu.fr/~magniez/PAPIERS/km-tods.pdf

Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract]

Autori: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

Prispievatelia: Dan Alistarh James Aspnes Keren Censor-hillel a ďalší

Zdroj: http://www.distcomp.ethz.ch/lectures/seminar/paper/Stephan/3.pdf.

Predmety: Categories and Subject Descriptors D.1.3 [Software, Programming Techniques—Concurrent programming, E.1 [Data, Data Structures, F.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms Alg, Theory Keywords distributed computing, shared memory, renaming, adaptive algorithms, sorting networks, lower bounds

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.2800; http://www.distcomp.ethz.ch/lectures/seminar/paper/Stephan/3.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.222.2800
http://www.distcomp.ethz.ch/lectures/seminar/paper/Stephan/3.pdf

Secretary Problems and Incentives via Linear Programming

Autori: Niv Buchbinder Kamal Jain Mohit Singh a ďalší

Prispievatelia: Niv Buchbinder Kamal Jain Mohit Singh a ďalší

Zdroj: http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Design, Performance, Theory Additional Key Words and Phrases, Secretary Problem, Linear Program, Duality

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6536; http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.6536
http://www.sigecom.org/exchanges/volume_8/2/buchbinder.pdf

Online Auctions and Generalized Secretary Problems

Autori: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

Prispievatelia: Moshe Babaioff Nicole Immorlica David Kempe a ďalší

Zdroj: http://www.ece.northwestern.edu/~nickle/pubs/sigecom-secretary.pdf.

Predmety: Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Online Algorithms, Secretary Problems, Auctions, Knapsack, Matroids

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.619
http://www.ece.northwestern.edu/~nickle/pubs/sigecom-secretary.pdf

Polylogarithmic Concurrent Data Structures from Monotone Circuits.

Autori: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN

Zdroj: Journal of the ACM; Feb2012, Vol. 59 Issue 1, p2-2:24, 24p

Predmety: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory

Precise Localization using Sweeps in Sparse Networks

Autori: Goldenberg, D. K. Bihler, P. Cao, M. a ďalší

Zdroj: Goldenberg, D K, Bihler, P, Cao, M, Fang, J, Anderson, B D O, Morse, A S & Yang, Y R 2006, Precise Localization using Sweeps in Sparse Networks. in Proceedings of the 12th ACM Annual International Conference on Mobile Computing and Networking (MobiCom). University of Groningen, Research Institute of Technology and Management, pp. 110-121, The 12th ACM Annual International Conference on Mobile Computing and Networking (MobiCom), Los Angeles, USA, 23/09/2006.

Témy: contributionToPeriodical

URL: https://research.rug.nl/en/publications/687b206a-24bc-4cab-8d5e-db1004224abf
https://hdl.handle.net/11370/687b206a-24bc-4cab-8d5e-db1004224abf
https://pure.rug.nl/ws/files/2841320/2006C07Mobicom06Goldenberg.pdf
info:eu-repo/semantics/altIdentifier/hdl/https://hdl.handle.net/11370/687b206a-24bc-4cab-8d5e-db1004224abf

Upward Max-Min Fairness.

Autori: DANNA, EMILIE HASSIDIM, AVINATAN KAPLAN, HAIM a ďalší

Zdroj: Journal of the ACM; Mar2017, Vol. 64 Issue 1, p2-2:24, 24p

Predmety: FAIRNESS, SOCIAL ethics, DOUBLE standard, ARBITRATOR impartiality, PARITY (Social sciences)

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into l1.

Autori: KHOT, SUBHASH A. VISHNOI, NISHEETH K.

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

Predmety: LOGICAL prediction, ALGORITHMS, COMPUTER programming, EMBEDDINGS (Mathematics), EMBEDDING theorems

Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity.

Autori: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN a ďalší

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

Predmety: COMPUTER programming, DISTRIBUTED databases, ALGORITHMS, POLYNOMIALS, ALGEBRA

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

Autori: BINBIN CHEN HAIFENG YU YUDA ZHAO a ďalší

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

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

Tight Bounds for Asynchronous Renaming.

Autori: ALISTARH, DAN ASPNES, JAMES CENSOR-HILLEL, KEREN a ďalší

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

Predmety: DISTRIBUTED computing, COMPUTATIONAL complexity, NAMESPACE (Computer science), DETERMINISTIC algorithms, LOGARITHMIC functions

The Space Complexity of Long-Lived and One-Shot Timestamp Implementations.

Autori: HELMI, MARYAM HIGHAM, LISA PACHECO, EDUARDO a ďalší

Zdroj: Journal of the ACM; Jan2014, Vol. 61 Issue 1, p7-25, 25p

Predmety: TIMESTAMPS, DATA loggers, UNIFORM Resource Identifiers, TIMEKEEPING, ALGORITHMS

Testing First-Order Properties for Subclasses of Sparse Graphs.

Autori: DVOŘÁK, ZDENĔK KRÁL', DANIEL THOMAS, ROBIN

Zdroj: Journal of the ACM; Oct2013, Vol. 60 Issue 5, p1-24, 24p

Predmety: FIRST-order phase transitions, PHASE transitions, SPARSE graphs, GRAPH theory, DENSE graphs

Decomposing Combinatorial Auctions and Set Packing Problems.

Autori: GOTTLOB, GEORG GRECO, GIANLUIGI

Zdroj: Journal of the ACM; Aug2013, Vol. 60 Issue 4, p1-39, 39p

Predmety: COMBINATORIAL auctions, HYPERGRAPHS, MATHEMATICAL decomposition, DECOMPOSITION method, MATHEMATICAL optimization