Suchergebnisse - Analysis of algorithms and problem complexity—Nonnumerical Algorithms and Problems General Terms*

Online Auctions and Generalized Secretary Problems. SIGecom Exchange 7

Autoren: Moshe Babaioff Nicole Immorlica David Kempe et al.

Weitere Verfasser: Moshe Babaioff Nicole Immorlica David Kempe et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

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

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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

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

Schlagwörter: graph algorithms, computational geometry, matrix multiplication

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

Verfügbarkeit: 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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

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

Schlagwörter: routing, mobile network, dynamic graphs

Dateibeschreibung: application/postscript

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

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

Approximation via Cost Sharing: Simpler and better . . .

Autoren: Anupam Gupta Amit Kumar Martin Pál et al.

Weitere Verfasser: Anupam Gupta Amit Kumar Martin Pál et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

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

Optimal-time adaptive strong renaming, with applications to counting

Autoren: Dan Alistarh James Aspnes Keren Censor-hillel et al.

Weitere Verfasser: Dan Alistarh James Aspnes Keren Censor-hillel et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

Verfügbarkeit: 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

Autoren: Moshe Babaioff Nicole Immorlica David Kempe et al.

Weitere Verfasser: Moshe Babaioff Nicole Immorlica David Kempe et al.

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

Schlagwörter: 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

Dateibeschreibung: application/pdf

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

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

Secretary Problems and Incentives via Linear Programming

Autoren: Niv Buchbinder Kamal Jain Mohit Singh et al.

Weitere Verfasser: Niv Buchbinder Kamal Jain Mohit Singh et al.

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

Schlagwörter: 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

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

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

Minimizing Movement

Autoren: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini et al.

Weitere Verfasser: Erik D. Demaine MohammadTaghi Hajiaghayi Hamid Mahini et al.

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

Schlagwörter: 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

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

Verfügbarkeit: 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

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

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

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

Dateibeschreibung: application/pdf

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

Verfügbarkeit: 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]

Autoren: Dan Alistarh James Aspnes Keren Censor-hillel et al.

Weitere Verfasser: Dan Alistarh James Aspnes Keren Censor-hillel et al.

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

Schlagwörter: 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

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

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

Distributed computation of the mode

Autoren: Fabian Kuhn Thomas Locher Stefan Schmid et al.

Weitere Verfasser: Fabian Kuhn Thomas Locher Stefan Schmid et al.

Quelle: http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf.

Schlagwörter: G.2.2 [Discrete Mathematics, Graph Theory graph algorithms, Graph Theory network problems General Terms Algorithms, Theory Keywords Aggregation, Distributed Algorithms, Mode, Most Frequent Element

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839; http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3839
http://people.csail.mit.edu/fkuhn/publications/podc08a.pdf

Polylogarithmic Concurrent Data Structures from Monotone Circuits.

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

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

Schlagwörter: DATA structures, LOGARITHMIC functions, COMPUTER circuits, COMPUTATIONAL complexity, ALGORITHMS, COMPUTER programming, MACHINE theory

Computing MEMs and Relatives on Repetitive Text Collections.

Autoren: Navarro, Gonzalo

Quelle: ACM Transactions on Algorithms; Jan2025, Vol. 21 Issue 1, p1-33, 33p

Schlagwörter: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

An Approximation Algorithm for Scheduling Malleable Tasks under General Precedence Constraints.

Autoren: Jansen, Klaus Zhang, Hu

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p416-434, 19p

Schlagwörter: ALGORITHMS, COMPUTATIONAL mathematics, ALGEBRA, COMPUTER programming, MATHEMATICAL analysis, INFORMATION technology

On Approximating Multicriteria TSP.

Autoren: Manthey, Bodo

Quelle: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 2, p17-17:18, 18p

Schlagwörter: APPROXIMATION algorithms, TRAVELING salesman problem, MATHEMATICAL symmetry, NUMERICAL analysis, PROBLEM solving, MAXIMA & minima, NUMBER theory

Cost-Oblivious Storage Reallocation.

Autoren: BENDER, MICHAEL A. FARACH-COlTON, MARTúN FEKETE, SÁNDOR P. et al.

Quelle: ACM Transactions on Algorithms; Mar2017, Vol. 13 Issue 3, p1-20, 20p

Schlagwörter: MATHEMATICAL bounds, COST functions, DATABASES, LOGARITHMIC functions, VIRTUAL storage (Computer science)

Local Ratio: A Unified Framework for Approximation Algorithms.

Autoren: Bar-Yehuda, Reuven Bendel, Keren Freund, Ari et al.

Quelle: ACM Computing Surveys; Dec2004, Vol. 36 Issue 4, p422-463, 42p

Schlagwörter: ALGORITHMS, APPROXIMATION theory, PRODUCTION scheduling, MATHEMATICAL optimization, LINEAR programming, OPERATIONS research

Faster Fixed Parameter Tractable Algorithms for Finding Feedback Vertex Sets.

Autoren: Raman, Venkatesh Saurabh, Saket Subramanian, C. R.

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p403-415, 13p

Schlagwörter: ACYCLIC model, HOMOLOGICAL algebra, ALGEBRAIC topology, ALGORITHMS, COMPUTATIONAL mathematics, MATHEMATICAL programming

Secure Multiparty Computation of Approximations.

Autoren: Feigenbaum, Joan Ishai, Yuval Malkin, Tal et al.

Quelle: ACM Transactions on Algorithms; 2006, Vol. 2 Issue 3, p435-472, 38p

Schlagwörter: ALGORITHMS, MATHEMATICAL analysis, APPROXIMATION theory, FUNCTIONAL analysis, MATHEMATICS, ALGEBRA

Distributed and Compact Routing Using Spatial Distributions in Wireless Sensor Networks.

Autoren: SARKAR, RIK ZHU, XIANJIN GAO, JIE

Quelle: ACM Transactions on Sensor Networks; May2013, Vol. 9 Issue 3, p32:1-32:20, 20p

Schlagwörter: WIRELESS sensor networks, SPATIAL distribution (Quantum optics), NETWORK routing protocols, ROUTING algorithms, GRAPH connectivity