Výsledky vyhľadávania - analysis of algorithms and ((problem OR problemy) OR problems) complexity—nonnumerical algorithms*

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

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

Computing MEMs and Relatives on Repetitive Text Collections.

Autori: Navarro, Gonzalo

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

Predmety: CODING theory, DATA structures, INFORMATION theory, DATA warehousing, COMPRESSIBILITY

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

Planar Minimization Diagrams via Subdivision with Applications to Anisotropic Voronoi Diagrams

Autori: Bennett, H Papadopoulou, E Yap, C a ďalší

Prispievatelia: Bennett, H Papadopoulou, E Yap, C a ďalší

Zdroj: Computer Graphics Forum. 35:229-247

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

Prí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

An experimental investigation of set intersection algorithms for text searching

Autori: Jérémy Barbay Alejandro López-ortiz Tyler Lu a ďalší

Prispievatelia: Jérémy Barbay Alejandro López-ortiz Tyler Lu a ďalší

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

Predmety: 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 súboru: application/pdf

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

Dostupnosť: 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

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

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

Autori: Harold N. Gabow The Pennsylvania State University CiteSeerX Archives

Prispievatelia: Harold N. Gabow The Pennsylvania State University CiteSeerX Archives

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

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

Popis súboru: 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

Dostupnosť: 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

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—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

LIPIcs, Volume 77, SoCG'17, Complete Volume

Autori: Aronov, Boris Katz, Matthew J. Boris Aronov and Matthew J. Katz

Prispievatelia: Aronov, Boris Katz, Matthew J. Boris Aronov and Matthew J. Katz

Predmety: 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 súboru: application/pdf

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

Computing MEMs and Relatives on Repetitive Text Collections

Autori: Gonzalo Navarro

Zdroj: ACM Transactions on Algorithms. 21:1-33

Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Prístupová URL adresa: http://arxiv.org/abs/2210.09914

On Approximating Multicriteria TSP.

Autori: Manthey, Bodo

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

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

LIPIcs, Volume 51, SoCG'16, Complete Volume

Autori: Fekete, Sándor Lubiw, Anna Sándor Fekete and Anna Lubiw

Prispievatelia: Fekete, Sándor Lubiw, Anna Sándor Fekete and Anna Lubiw

Predmety: 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 súboru: application/pdf

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

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

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

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