Výsledky vyhledávání - Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems*

Optimal Algorithms for Compact Linear Layouts

Autoři: Willem Sonke Eric Verbeek Wouter Meulemans a další

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

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

Pří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

Autoři: Barbay, Jérémy Kenyon, Claire

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

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

Pří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

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

Autoři: Leslie De Koninck The Pennsylvania State University CiteSeerX Archives

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

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

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

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

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams

Autoři: Bennett, H Papadopoulou, E Yap, C a další

Přispěvatelé: Bennett, H Papadopoulou, E Yap, C a další

Zdroj: Computer Graphics Forum. 35:229-247

Témata: 5 [Computer Graphics]: Computational Geometry and Object ModelingGeometric algorithms, Technology, Science & Technology, Software Engineering, 2 [Numerical Analysis]: ApproximationApproximation of surfaces and contours, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and ProblemsGeometrical problems and computations, Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Categories and Subject Descriptors (according to ACM CCS), 0 [Numerical Analysis]: GeneralInterval arithmetic, 4 [Mathematical Software]: Algorithm design and analysis

Přístupová URL adresa: https://repository.icr.ac.uk/handle/internal/3463
https://dl.acm.org/doi/10.5555/3061451.3061482
https://diglib.eg.org:443/handle/10.1111/cgf12979
https://nyuscholars.nyu.edu/en/publications/planar-minimization-diagrams-via-subdivision-with-applications-to-2
http://onlinelibrary.wiley.com/doi/10.1111/cgf.12979/full
https://onlinelibrary.wiley.com/doi/10.1111/cgf.12979

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

Computing MEMs and Relatives on Repetitive Text Collections.

Autoři: Navarro, Gonzalo

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

Témata: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

An experimental investigation of set intersection algorithms for text searching

Autoři: Jérémy Barbay Alejandro López-ortiz Tyler Lu a další

Přispěvatelé: Jérémy Barbay Alejandro López-ortiz Tyler Lu a další

Zdroj: http://users.dcc.uchile.cl/~jbarbay/MyPublications/2009-JEA-AnExperimentalInvestigationOfSetIntersectionAlgorithmsForTextSearching-BarbayLopezOrtizLuSalinger.pdf.

Témata: Categories and Subject Descriptors, F.2.2 [Theory of Computation, Analysis of Algorithms and Problem Complexity—Nonnumerical Algorithms and Problems, Computations on discrete structures General Terms, Algorithms, Design, Experimentation, Performance, Theory Additional Key Words and Phrases, Database queries, set intersection

Popis souboru: application/pdf

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.3756
http://users.dcc.uchile.cl/~jbarbay/MyPublications/2009-JEA-AnExperimentalInvestigationOfSetIntersectionAlgorithmsForTextSearching-BarbayLopezOrtizLuSalinger.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

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

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

Témata: word-RAM algorithms, sorting, point location, convex hulls, segment intersection

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

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

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

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

Témata: General Terms, Algorithms Additional Key Words and Phrases, String algorithms, approximation algorithms

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

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

[Analysis of Algorithms and Problem Complexity] Nonnumerical Algorithms and Problems--computauons

Autoři: Harold N. Gabow The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Harold N. Gabow The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.columbia.edu/~cs2035/courses/ieor6400.F07/gab.pdf.

Témata: algortthms General Terms. Algorithms, Theory Addmonal Key Words and Phrases Precedence constraints, cnUcal path scheduling, highest-level-first scheduling, directed acychc

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.3911; http://www.columbia.edu/~cs2035/courses/ieor6400.F07/gab.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.3911
http://www.columbia.edu/~cs2035/courses/ieor6400.F07/gab.pdf

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--Geometrical problems and computations

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

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

Témata: General Terms, Algorithms, Experimentation Additional Key Words and Phrases, Linear Programming, Integer Programming

Popis souboru: application/postscript

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

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

Autoři: Fabian Kuhn Roger Wattenhofer Aaron Zollinger a další

Přispěvatelé: Fabian Kuhn Roger Wattenhofer Aaron Zollinger a další

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

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

Popis souboru: application/pdf

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

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

LIPIcs, Volume 77, SoCG'17, Complete Volume

Autoři: Aronov, Boris Katz, Matthew J. Boris Aronov and Matthew J. Katz

Přispěvatelé: Aronov, Boris Katz, Matthew J. Boris Aronov and Matthew J. Katz

Témata: Discrete Mathematics, Analysis of Algorithms and Problem Complexity, ddc:004, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017

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

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

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

Témata: pseudo-triangulation, kinetic data structure

Popis souboru: application/pdf

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

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

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

Autoři: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a další

Přispěvatelé: Khaireel A. Mohamed Tobias Langner Thomas Ottmann a další

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

Témata: Partial persistence, path-merging, path-copying, node

Popis souboru: application/pdf

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

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

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

LIPIcs, Volume 51, SoCG'16, Complete Volume

Autoři: Fekete, Sándor Lubiw, Anna Sándor Fekete and Anna Lubiw

Přispěvatelé: Fekete, Sándor Lubiw, Anna Sándor Fekete and Anna Lubiw

Témata: Discrete Mathematics, Combinatorics, Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics, Combinatorics, Computer Graphics, Computational Geometry and Object Modeling, Analysis of Algorithms and Problem Complexity, Computer Graphics, ddc:004, Computational Geometry and Object Modeling, Nonnumerical Algorithms and Problems – Geometrical problems and computations

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016

LIPIcs, Volume 34, SoCG'15, Complete Volume

Autoři: Arge, Lars Pach, János Lars Arge and János Pach

Přispěvatelé: Arge, Lars Pach, János Lars Arge and János Pach

Témata: Discrete Mathematics, Analysis of Algorithms and Problem Complexity, ddc:004, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics

Popis souboru: application/pdf

Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015

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