Search Results - "Analysis of Algorithms and Problem Complexity- Numerical Algorithms and Problems"

LIPIcs, Volume 81, APPROX/RANDOM'17, Complete Volume

Authors: Jansen, Klaus Rolim, José D. P. Williamson, David et al.

Contributors: Jansen, Klaus Rolim, José D. P. Williamson, David et al.

Subject Terms: Analysis of Algorithms and Problem Complexity, Online computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems, Nonnumerical Algorithms and Problems [Network Architecture and Design, Coding and Information Theory, Error Control Codes, Modes of Computation], Coding and Information Theory, ddc:004, Complexity Measures and Classes, Error Control Codes, Nonnumerical Algorithms and Problems, Modes of Computation: Online computation, Numerical Algorithms and Problems, Network Architecture and Design

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017

LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume

Authors: Jansen, Klaus Mathieu, Claire Rolim, José D. P. et al.

Contributors: Jansen, Klaus Mathieu, Claire Rolim, José D. P. et al.

Subject Terms: Analysis of Algorithms and Problem Complexity, Models of Computation, Theory of Computation, ddc:004, Complexity Measures and Classes, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems, Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems, Modes of Computation – Online Computation

File Description: application/pdf

Access URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016

Compiler Blockability of Dense Matrix Factorizations

Authors: Carr, Steve Lehoucq, R. B.

Source: Michigan Tech Publications

Subject Terms: D.3.4 [Programming Languages]: Processors - compilers, F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems - computations on matrices, Optimization

Relation: https://doi.org/10.1145/275323.275325

Availability: https://digitalcommons.mtu.edu/michigantech-p/12557
https://doi.org/10.1145/275323.275325

Brief Announcement: Lower Bounds on Communication for Sparse Cholesky Factorization of a Model Problem

Authors: Laura Grigori Pierre-yves David Sylvain Peyronnet et al.

Contributors: Laura Grigori Pierre-yves David Sylvain Peyronnet et al.

Source: http://bebop.cs.berkeley.edu/pubs/spaa067-grigori.pdf.

Subject Terms: Categories and Subject Descriptors, F.2.1 [Theory of Computation, Analysis of Algorithms and Problem Complexity- Numerical Algorithms and Problems, Computations on matrices General Terms, Algorithms Keywords, communication bounds, sparse Cholesky

File Description: application/pdf

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

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.5487
http://bebop.cs.berkeley.edu/pubs/spaa067-grigori.pdf

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)

Contributors: Jansen, Klaus Mathieu, Claire Rolim, José D. P. et al.

Availability: http://data.europeana.eu/aggregation/europeana/2048441/item_NAMDODOHHLLYF5VQONYTE3SE3XB2J56U
http://data.europeana.eu/item/2048441/item_NAMDODOHHLLYF5VQONYTE3SE3XB2J56U

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)

Contributors: Jansen, Klaus Rolim, José D. P. Devanur, Nikhil R. et al.

Availability: http://data.europeana.eu/aggregation/europeana/2048441/item_MVHMRKLZ7ZX2AMZSVL6H2FLNMJS45AGU
http://data.europeana.eu/item/2048441/item_MVHMRKLZ7ZX2AMZSVL6H2FLNMJS45AGU

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)

Contributors: Garg, Naveen Jansen, Klaus Rao, Anup et al.

Availability: http://data.europeana.eu/aggregation/europeana/2048441/item_ML7DESZILFUZPX5CWAGGBLBSCGV7IUUT
http://data.europeana.eu/item/2048441/item_ML7DESZILFUZPX5CWAGGBLBSCGV7IUUT

LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume

Authors: Klaus Jansen and Claire Mathieu and José D. P. Rolim and Chris Umans Jansen, Klaus Mathieu, Claire et al.

Index Terms: Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems, Proceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016
Is Part Of LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)