Výsledky vyhľadávania - "F.2.2 [Analysis of Algorithms and Problem Complexity]"

Optimal Algorithms for Compact Linear Layouts

Autori: Willem Sonke Eric Verbeek Wouter Meulemans a ďalší

Zdroj: 2018 IEEE Pacific Visualization Symposium (PacificVis). :1-10

Predmety: Graph/Network Data, Geometry based Techniques, 11. Sustainability, Folding, Linear layouts, F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems, 0102 computer and information sciences, Routing and layout, 01 natural sciences

Prístupová URL adresa: https://research.tue.nl/en/publications/2e370ddf-e3bd-4d42-87f7-53d8bb312fdf
https://research.tue.nl/en/publications/optimal-algorithms-for-compact-linear-layouts-2
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ff550cf2b-aef8-4e45-ac94-300fb43ddd2c
https://ieeexplore.ieee.org/document/8365970/
https://dblp.uni-trier.de/db/conf/apvis/pacificvis2018.html#SonkeVMVS18
http://doi.ieeecomputersociety.org/10.1109/PacificVis.2018.00010

Alternation and redundancy analysis of the intersection problem

Autori: Barbay, Jérémy Kenyon, Claire

Zdroj: ACM Transactions on Algorithms. 4:1-18

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problemsâ€'Sorting and searching, 4. Education, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 7. Clean energy

Popis súboru: application/pdf

Prístupová URL adresa: http://www.cs.brown.edu/~claire/Publis/jeremy.pdf
https://cs.brown.edu/~claire/Publis/jeremy.pdf
https://dblp.uni-trier.de/db/journals/talg/talg4.html#BarbayK08
https://doi.org/10.1145/1328911.1328915
https://dl.acm.org/doi/10.1145/1328911.1328915

Categories and Subject Descriptors F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems—geometrical

Autori: Fabian Kuhn Roger Wattenhofer Aaron Zollinger a ďalší

Prispievatelia: Fabian Kuhn Roger Wattenhofer Aaron Zollinger a ďalší

Zdroj: http://theory.csail.mit.edu/classes/6.885/spring06/papers/KuhnWZ-dialm03.pdf.

Predmety: General Terms Algorithms, Performance, Theory Keywords Ad-Hoc Networks, Face Routing, Flooding, Geometric Routing, Mobile Computing, Modeling, Unit Disk Graphs, Wireless Communication

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.9191
http://theory.csail.mit.edu/classes/6.885/spring06/papers/KuhnWZ-dialm03.pdf

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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.stolaf.edu/people/olaf/papers/vid06-hall-holt.pdf.

Predmety: pseudo-triangulation, kinetic data structure

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.3523
http://www.stolaf.edu/people/olaf/papers/vid06-hall-holt.pdf

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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

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

Predmety: word-RAM algorithms, sorting, point location, convex hulls, segment intersection

Popis súboru: application/postscript

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.9362
http://www.cs.uwaterloo.ca/~tmchan/nearlin_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://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--Geometrical problems and computations

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.math.tu-berlin.de/~luebbeck/papers/rcover-jea.ps.gz.

Predmety: General Terms, Algorithms, Experimentation Additional Key Words and Phrases, Linear Programming, Integer Programming

Popis súboru: application/postscript

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.6595
http://www.math.tu-berlin.de/~luebbeck/papers/rcover-jea.ps.gz

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

Prispievatelia: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://matsrv.math.cas.cz/~sgall/ps/strings.ps.

Predmety: General Terms, Algorithms Additional Key Words and Phrases, String algorithms, approximation algorithms

Popis súboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9320; http://matsrv.math.cas.cz/~sgall/ps/strings.ps

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.9320
http://matsrv.math.cas.cz/~sgall/ps/strings.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

Data Storage Representations – linked representations; F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems – Geometrical problems and computations.

Autori: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a ďalší

Prispievatelia: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a ďalší

Zdroj: http://dcg.ethz.ch/publications/mohamed_langner_ottmann_faw08_pub_-1.pdf.

Predmety: Partial persistence, path-merging, path-copying, node

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.5226
http://dcg.ethz.ch/publications/mohamed_langner_ottmann_faw08_pub_-1.pdf

Truthful mechanism design via correlated tree rounding

Autori: Yossi Azar Martin Hoefer The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Yossi Azar Martin Hoefer The Pennsylvania State University CiteSeerX Archives

Zdroj: http://people.mpi-inf.mpg.de/%7Emhoefer/08-0x/Azar15Tree.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnu- merical Algorithms and Problems General Terms, Algorithms, Economics, Theory Additional Key Words and Phrases, Mechanism Design, Rounding, Combinatorial Auctions, Scheduling Mechanisms

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.720.2321
http://people.mpi-inf.mpg.de/%7Emhoefer/08-0x/Azar15Tree.pdf

Nonnumerical Algorithms and Problems — Sequencing and schedulingMergeable Schedules for Lazy Matching

Autori: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf.

Predmety: Schedules, lazy pattern matching, rule based languages. CR Subject Classification, E.1 [Data Structures, F.2.2 [Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems — Pattern, F.2.2 [Analysis of Algorithms and Problem Complexity

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5474; http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.5474
http://www.cs.kuleuven.ac.be/publicaties/rapporten/cw/CW505.pdf

Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems

Autori: Chien-ju Hoy Aleksandrs Slivkinsz Jennifer Wortman Vaughanx a ďalší

Prispievatelia: Chien-ju Hoy Aleksandrs Slivkinsz Jennifer Wortman Vaughanx a ďalší

Zdroj: http://www.jennwv.com/papers/dynamicpa.pdf.

Predmety: ACM Categories and subject descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems, F.1.2 [Computation by Abstract Devices, Modes of Computation|Online computation, J.4 [Social and Behavioral Sciences, Economics Keywords, crowdsourcing, principal-agent, dynamic pricing, multi-armed bandits, regret

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.5081; http://www.jennwv.com/papers/dynamicpa.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.5081
http://www.jennwv.com/papers/dynamicpa.pdf

Computing rational solutions of linear matrix inequalities

Autori: Qingdong Guo Mohab Safey El Din Lihong Zhi a ďalší

Prispievatelia: Qingdong Guo Mohab Safey El Din Lihong Zhi a ďalší

Zdroj: http://hal.inria.fr/docs/00/81/51/74/PDF/rational-lmi-6.pdf.

Predmety: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms—algebraic algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Non numerical algorithms and problems—complexity of proof procedures

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.1825
http://hal.inria.fr/docs/00/81/51/74/PDF/rational-lmi-6.pdf

On the Complexity of Computing Gröbner Bases for Quasi-Homogeneous Systems

Autori: Jean-charles Faugère Mohab Safey El Din Thibaut Verron a ďalší

Prispievatelia: Jean-charles Faugère Mohab Safey El Din Thibaut Verron a ďalší

Zdroj: http://www-spiral.lip6.fr/~safey/Articles/QuasiHomoGB-ISSAC.pdf.

Predmety: Categories and Subject Descriptors I.1.2 [Symbolic and Algebraic Manipulation, Algorithms, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems Keywords Gröbner bases, Polynomial system solving, Quasi-homogeneous

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.415.3398
http://www-spiral.lip6.fr/~safey/Articles/QuasiHomoGB-ISSAC.pdf

CINEMA: Conformity-Aware Greedy Algorithm for Influence Maximization in Online Social Networks

Autori: Hui Li Sourav S Bhowmick Aixin Sun a ďalší

Prispievatelia: Hui Li Sourav S Bhowmick Aixin Sun a ďalší

Zdroj: http://www.edbt.org/Proceedings/2013-Genova/papers/edbt/a30-li.pdf.

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.2276
http://www.edbt.org/Proceedings/2013-Genova/papers/edbt/a30-li.pdf

On the Streaming Complexity of Computing Local Clustering Coefficients

Autori: Konstantin Kutzkov Rasmus Pagh The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Konstantin Kutzkov Rasmus Pagh The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.itu.dk/people/pagh/papers/clustercoeff.pdf.

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.6617; http://www.itu.dk/people/pagh/papers/clustercoeff.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.6617
http://www.itu.dk/people/pagh/papers/clustercoeff.pdf

Sensor Network Localization by Eigenvector Synchronization Over the Euclidean Group

Autori: Mihai Cucuringu Yaron Lipman Amit Singer a ďalší

Prispievatelia: Mihai Cucuringu Yaron Lipman Amit Singer a ďalší

Zdroj: https://web.math.princeton.edu/~amits/publications/sensors_TOSN_published.pdf.

Predmety: Categories and Subject Descriptors, C.2.4 [Computer-Communication Networks, Distributed Systems—Distributed applications, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Routing and layout General Terms, Algorithms, Theory Additional Key Words and Phrases, Sensor networks, distance geometry, eigenvectors, synchronization, rigidity theory, spectral graph theory ACM Reference Format

Popis súboru: application/pdf

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

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.6688

Unconditional differentially private mechanisms for linear queries

Autori: Aditya Bhaskara Daniel Dadush Kunal Talwar a ďalší

Prispievatelia: Aditya Bhaskara Daniel Dadush Kunal Talwar a ďalší

Zdroj: http://cs.nyu.edu/~dadush/papers/mech.pdf.

Predmety: F.2.2 [Analysis of Algorithms and Problem Complexity

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.391; http://cs.nyu.edu/~dadush/papers/mech.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.422.391
http://cs.nyu.edu/~dadush/papers/mech.pdf

Prize-Collecting Steiner Network Problems

Autori: MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov The Pennsylvania State University CiteSeerX Archives

Prispievatelia: MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf.

Predmety: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory Additional Key Words and Phrases, Steiner network problem, prize-collecting, edge-connectivity, vertexconnectivity, all-or-nothing flows ACM Reference Format

Popis súboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3699; http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf

Dostupnosť: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.3699
http://crab.rutgers.edu/~guyk/pub/pc/nabs.pdf