×

Found 136 Documents (Results 1–100)

A deterministic distributed algorithm for exact weighted all-pairs shortest paths in \(\tilde{O}(n^{3/2})\) rounds. (English) Zbl 1428.68363

Proceedings of the 37th ACM symposium on principles of distributed computing, PODC ’18, Egham, UK, July 23–27, 2018. New York, NY: Association for Computing Machinery (ACM). 199-205 (2018).
MSC:  68W15 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI arXiv

Fine-grained complexity for sparse graphs. (English) Zbl 1427.68110

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 239-252 (2018).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Proceedings of the 19th workshop on algorithm engineering and experiments, ALENEX ’17, Barcelona, Spain, January 17–18, 2017. (English) Zbl 1380.68009

Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-1-61197-476-8/ebook). 269 p., electronic only (2017).
MSC:  68-06 00B25
PDFBibTeX XMLCite
Full Text: DOI

Finding \(k\) simple shortest paths and cycles. (English) Zbl 1398.05190

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 8, 12 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Decremental all-pairs ALL shortest paths and betweenness centrality. (English) Zbl 1435.05066

Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8889, 766-778 (2014).
MSC:  05C12 05C38
PDFBibTeX XMLCite
Full Text: DOI arXiv

Betweenness centrality – incremental and faster. (English) Zbl 1407.68368

Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 577-588 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Revisiting the cache miss analysis of multithreaded algorithms. (English) Zbl 1353.68296

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 172-183 (2012).
MSC:  68W15 68W40
PDFBibTeX XMLCite
Full Text: DOI

Resource oblivious sorting on multicores. (English) Zbl 1287.68032

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 226-237 (2010).
MSC:  68P10 68M20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Provably good multicore cache performance for divide-and-conquer algorithms. (English) Zbl 1192.68026

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 501-510 (2008).
MSC:  68M10 68M07
PDFBibTeX XMLCite

The \(k\)-orientability thresholds for \(G_{n,p}\). (English) Zbl 1302.05169

Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 459-468 (2007).
MSC:  05C80 05C20 68M07
PDFBibTeX XMLCite

Cache-oblivious dynamic programming. (English) Zbl 1192.90241

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 591-600 (2006).
PDFBibTeX XMLCite
Full Text: DOI

External-memory exact and approximate all-pairs shortest-paths in undirected graphs. (English) Zbl 1297.05069

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 735-744 (2005).
PDFBibTeX XMLCite

On contract-and-refine transformations between phylogenetic trees. (English) Zbl 1318.92037

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 900-909 (2004).
PDFBibTeX XMLCite

Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms. (English) Zbl 1093.68675

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 713-722 (2002).
MSC:  68W20
PDFBibTeX XMLCite

Computing shortest paths with comparisons and additions. (English) Zbl 1258.90101

Proceedings of the thirteenth annual ACM-SIAM symposium on discrete algorithms (SODA 2002), San Francisco, CA, USA, January 6–8, 2002. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-513-X/pbk). 267-276 (2002).
MSC:  90C35
PDFBibTeX XMLCite

Improved distance oracles for avoiding link-failure. (English) Zbl 1019.68805

Bose, Prosenjit (ed.) et al., Algorithms and computation. 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2518, 523-534 (2002).
MSC:  68W05 68R10
PDFBibTeX XMLCite
Full Text: Link

Experimental evaluation of a new shortest path algorithm. (English) Zbl 1014.68674

Mount, David M. (ed.) et al., Algorithm engineering and experiments. 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2409, 126-142 (2002).
PDFBibTeX XMLCite
Full Text: Link

Equivalence class approach for web link classification. (English) Zbl 0970.68526

Mohammadian, Masoud (ed.), Computational intelligence for modelling, control & automation ’99. Intelligent image processing, data analysis & information retrieval. International conference, Vienna, Austria, February 17-19, 1999. Amsterdam: IOS Press). Concurrent Syst. Eng. Ser. 56, 205-210 (1999).
MSC:  68U99 68M10
PDFBibTeX XMLCite

Emulations between QSM, BSP and LogP: A framework for general-purpose parallel algorithm design. (English) Zbl 0934.68099

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. S 957-S 958 (1999).
MSC:  68U20 68W10
PDFBibTeX XMLCite

Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems. (English) Zbl 1477.68234

Burkard, Rainer (ed.) et al., Algorithms – ESA ’97. 5th annual European symposium, Graz, Austria, September 15–17, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1284, 326-340 (1997).
PDFBibTeX XMLCite
Full Text: DOI Link

Parallel implementation of algorithms for finding connected components in graphs. (English) Zbl 0887.68049

Bhatt, Sandeep N. (ed.), Parallel algorithms. 3rd DIMACS implementation challenge, October 17-19, 1994. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 30, 23-41 (1997).
PDFBibTeX XMLCite

Generation of stable 2-D transfer functions having variable magnitude characteristics. (English) Zbl 0833.93037

Leondes, C. T. (ed.), Multidimensional systems: signal processing and modeling techniques. San Diego, CA: Academic Press. Control Dyn. Syst., Adv. Theory Appl. 69, 255-297 (1995).
MSC:  93C62 93D20 93B40
PDFBibTeX XMLCite

Generation of very strict Hurwitz polynomials and applications to 2-D filter design. (English) Zbl 0833.93039

Leondes, C. T. (ed.), Multidimensional systems: signal processing and modeling techniques. San Diego, CA: Academic Press. Control Dyn. Syst., Adv. Theory Appl. 69, 211-254 (1995).
MSC:  93C62 93B40 93B55
PDFBibTeX XMLCite

Implementation of parallel graph algorithms on the MasPar. (English) Zbl 0941.68829

Dean, Nathaniel (ed.) et al., Computational support for discrete mathematics. DIMACS workshop March 12-14, 1992. Papers based on talks given at the DIMACS workshop held at Rutgers University, Piscataway, NJ, USA. Providence, RI: American Mathematical Society, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 15, 165-198 (1994).
PDFBibTeX XMLCite

The QRQW PRAM: Accounting for contention in parallel algorithms. (English) Zbl 0871.68094

Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, Arlington, VA, USA, January 23-25, 1994. New York, NY: ACM, 638-648 (1994).
MSC:  68W15
PDFBibTeX XMLCite

An efficient parallel algorithm for the general planar monotone circuit value problem. (English) Zbl 0871.68092

Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms, Arlington, VA, USA, January 23-25, 1994. New York, NY: ACM, 622-631 (1994).
MSC:  68W15 68T27
PDFBibTeX XMLCite

Computing minimal spanning subgraphs in linear time. (English) Zbl 0829.68093

Frederickson, Greg (ed.), Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, held January 27-29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM. 146-156 (1992).
MSC:  68R10 68Q25
PDFBibTeX XMLCite

On finding minimal 2-connected subgraphs. (English) Zbl 0800.68632

Aggarwal, Alok (ed.), Discrete algorithms. Proceedings of the 2nd annual ACM-SIAM symposium, held January 28-30, 1991, in San Francisco, CA (USA). Philadelphia, PA: SIAM. 178-187 (1991).
MSC:  68R10 68W15
PDFBibTeX XMLCite

Parallel algorithms for shared-memory machines. (English) Zbl 0900.68267

Van Leeuwen, Jan (ed.), Algorithms and complexity. Handbook of theoretical computer science. Vol. A. Amsterdam etc.: Elsevier Science Publishers. 869-941 (1990).
MSC:  68Q25 11Y16 94A60
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software