Search Results - "Near-Linear Time Algorithm"

Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding

Authors: Klaus Jansen Alexandra Lassota Lars Rohwedder et al.

Contributors: Klaus Jansen Alexandra Lassota Lars Rohwedder et al.

Source: SIAM Journal on Discrete Mathematics. 34:2282-2299

Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, Near-Linear Time Algorithm, 01 natural sciences, n-fold ILP, Color Coding

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/opus/volltexte/2019/10651/pdf/LIPIcs-ICALP-2019-75.pdf
http://arxiv.org/abs/1811.00950
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-00950
https://epubs.siam.org/doi/abs/10.1137/19M1303873
https://dblp.uni-trier.de/db/conf/icalp/icalp2019.html#JansenLR19
https://drops.dagstuhl.de/opus/volltexte/2019/10651/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.75

A Dichotomy for Regular Expression Membership Testing

Authors: Bringmann, K. Grønlund, A. Larsen, K. G.

Source: Bringmann, K, Grønlund, A & Larsen, K G 2017, A Dichotomy for Regular Expression Membership Testing. in Proceedings-58th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2017., 8104068, IEEE Computer Society Press, pp. 307-318, 58th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, California, United States, 15/10/2017. https://doi.org/10.1109/FOCS.2017.36

Subject Terms: regular expressions, FOS: Computer and information sciences, combinatorial algorithms, improved upper bounds, Informatics, string matching, word break problem, Testing, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), algorithms, regular expression membership testing, 01 natural sciences, near-linear time algorithm, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Pattern matching, Fast Fourier transforms, bounded-depth homogeneous regular expressions, computational complexity, improved Õ(nm1/3 + m) algorithm, strong exponential time hypothesis, combinatorial mathematics, quadratic time algorithm, Computer science, quadratic conditional lower bound, Computer Science - Computational Complexity, Electronic mail, pattern matching, Dictionaries, almost-linear time algorithms, conditional hardness

File Description: application/pdf

Access URL: http://arxiv.org/pdf/1611.00918
http://arxiv.org/abs/1611.00918
http://ui.adsabs.harvard.edu/abs/2016arXiv161100918B/abstract
https://arxiv.org/abs/1611.00918
https://pure.mpg.de/pubman/faces/ViewItemOverviewPage.jsp?itemId=item_2388211
https://dblp.uni-trier.de/db/journals/corr/corr1611.html#BringmannGL16
https://ieeexplore.ieee.org/document/8104068/
http://ieeexplore.ieee.org/document/8104068/
http://hdl.handle.net/11858/00-001M-0000-002C-5302-B
http://hdl.handle.net/11858/00-001M-0000-002C-5300-F
http://www.scopus.com/inward/record.url?scp=85041130278&partnerID=8YFLogxK
https://pure.au.dk/portal/en/publications/5e8a0c31-1c64-4211-8f8f-d8648136fdde
https://doi.org/10.1109/FOCS.2017.36

Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences

Authors: Agarwal, Pankaj K. Fox, Kyle Pan, Jiangwei et al.

Contributors: Agarwal, Pankaj K. Fox, Kyle Pan, Jiangwei et al.

Subject Terms: Dynamic time warping, Edit distance, Near-linear-time algorithm, Dynamic programming, Well-separated pair decomposition

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.6

Availability: https://doi.org/10.4230/LIPIcs.SoCG.2016.6
https://nbn-resolving.org/urn:nbn:de:0030-drops-58989
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.6

Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences

Authors: Agarwal, Pankaj K. Fox, Kyle Pan, Jiangwei et al.

Contributors: Agarwal, Pankaj K. Fox, Kyle Pan, Jiangwei et al.

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Edit distance, Near-linear-time algorithm, 0102 computer and information sciences, 02 engineering and technology, Dynamic programming, 01 natural sciences, Well-separated pair decomposition, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic time warping, F.2.2

File Description: application/pdf

Access URL: http://arxiv.org/abs/1512.01876
https://arxiv.org/abs/1512.01876
https://arxiv.org/pdf/1512.01876
https://dblp.uni-trier.de/db/journals/corr/corr1512.html#AgarwalFPY15
https://drops.dagstuhl.de/opus/volltexte/2016/5898/pdf/LIPIcs-SoCG-2016-6.pdf/
https://drops.dagstuhl.de/opus/volltexte/2016/5898/
http://ui.adsabs.harvard.edu/abs/2015arXiv151201876A/abstract
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.6

Fully Dynamic Approximate k-Core Decomposition in Hypergraphs

Authors: Bintao Sun T. -H. Hubert Chan Mauro Sozio et al.

Contributors: Bintao Sun T. -H. Hubert Chan Mauro Sozio et al.

Subject Terms: Network algorithm, Theory of computation, Online algorithm, Streaming, sublinear and near linear time algorithm, Core values, dynamic network, hypergraphs

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000583626600002; volume:14; issue:4; firstpage:1; lastpage:21; numberofpages:21; journal:ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA; https://hdl.handle.net/11385/251383

Availability: https://hdl.handle.net/11385/251383
https://doi.org/10.1145/3385416

Near-Linear Time Algorithm for n-fold ILPs via Color Coding

Authors: Jansen, Klaus Lassota, Alexandra Rohwedder, Lars

Index Terms: Near-Linear Time Algorithm, n-fold ILP, Color Coding, Data processing Computer science, InProceedings, publishedVersion