Výsledky vyhledávání - "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

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

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

Témata: graph algorithms, computational geometry, matrix multiplication

Popis souboru: 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

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

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

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

Témata: routing, mobile network, dynamic graphs

Popis souboru: application/postscript

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

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

Autoři: Dan Alistarh James Aspnes Keren Censor-hillel a další

Přispěvatelé: Dan Alistarh James Aspnes Keren Censor-hillel a další

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

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

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

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

Autoři: Moshe Babaioff Nicole Immorlica David Kempe a další

Přispěvatelé: Moshe Babaioff Nicole Immorlica David Kempe a další

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

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

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

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

Autoři: Anupam Gupta Amit Kumar Martin Pál a další

Přispěvatelé: Anupam Gupta Amit Kumar Martin Pál a další

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

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

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

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

Minimizing Movement

Autoři: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a další

Přispěvatelé: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini a další

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

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

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

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

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

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

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

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

Autoři: Dan Alistarh James Aspnes Keren Censor-hillel a další

Přispěvatelé: Dan Alistarh James Aspnes Keren Censor-hillel a další

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

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

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

Autoři: Niv Buchbinder Kamal Jain Mohit Singh a další

Přispěvatelé: Niv Buchbinder Kamal Jain Mohit Singh a další

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

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

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

Autoři: Moshe Babaioff Nicole Immorlica David Kempe a další

Přispěvatelé: Moshe Babaioff Nicole Immorlica David Kempe a další

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

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

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

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

Autoři: ASPNES, JAMES ATTIYA, HAGIT CENSOR-HILLEL, KEREN

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

Témata: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory

Precise Localization using Sweeps in Sparse Networks

Autoři: Goldenberg, D. K. Bihler, P. Cao, M. a další

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émata: 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.

Autoři: DANNA, EMILIE HASSIDIM, AVINATAN KAPLAN, HAIM a další

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

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

Autoři: KHOT, SUBHASH A. VISHNOI, NISHEETH K.

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

Témata: LOGICAL prediction, ALGORITHMS, COMPUTER programming, EMBEDDINGS (Mathematics), EMBEDDING theorems

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

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

Autoři: HELMI, MARYAM HIGHAM, LISA PACHECO, EDUARDO a další

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

Témata: TIMESTAMPS, DATA loggers, UNIFORM Resource Identifiers, TIMEKEEPING, ALGORITHMS

Testing First-Order Properties for Subclasses of Sparse Graphs.

Autoři: DVOŘÁK, ZDENĔK KRÁL', DANIEL THOMAS, ROBIN

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

Témata: FIRST-order phase transitions, PHASE transitions, SPARSE graphs, GRAPH theory, DENSE graphs

Decomposing Combinatorial Auctions and Set Packing Problems.

Autoři: GOTTLOB, GEORG GRECO, GIANLUIGI

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

Témata: COMBINATORIAL auctions, HYPERGRAPHS, MATHEMATICAL decomposition, DECOMPOSITION method, MATHEMATICAL optimization