Metadata Search Funding Data Link References Status API Help
Facet browsing currently unavailable
Page 2 of 963 results
Sort by: relevance publication year
Showing results for ISSN matching 1549-6325

Tight Space Bounds for Two-Dimensional Approximate Range Counting

JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms

Research funded by HKRGC (GRF-16211614, GRF-16200415 and GRF-16202317) | Research Funds of Renmin University of China (18XNLG21) | National Natural Science Foundation of China (61502503)

Authors: Zhewei Wei | Ke Yi

https://doi.org/10.1145/3205454 Actions

Perfect matchings via uniform sampling in regular bipartite graphs

JOURNAL ARTICLE published March 2010 in ACM Transactions on Algorithms

Research funded by Division of Computing and Communication Foundations (CCF-0635084) | National Science Foundation (428868,339262)

Authors: Ashish Goel | Michael Kapralov | Sanjeev Khanna

https://doi.org/10.1145/1721837.1721843 Actions

Kernel(s) for problems with no kernel

JOURNAL ARTICLE published September 2012 in ACM Transactions on Algorithms

Research funded by Rigorous Theory of Preprocessing (267959)

Authors: Daniel Binkele-Raible | Henning Fernau | Fedor V. Fomin | Daniel Lokshtanov | Saket Saurabh | Yngve Villanger

https://doi.org/10.1145/2344422.2344428 Actions

JOURNAL ISSUE published 15 June 2016 in ACM Transactions on Algorithms

https://doi.org/10.1145/2930058 Actions

JOURNAL ISSUE published 1 June 2013 in ACM Transactions on Algorithms

https://doi.org/10.1145/2483699 Actions

JOURNAL ISSUE published 1 February 2014 in ACM Transactions on Algorithms

https://doi.org/10.1145/2578852 Actions

JOURNAL ISSUE published 4 June 2018 in ACM Transactions on Algorithms

https://doi.org/10.1145/3196491 Actions

Approximating Spanners and Directed Steiner Forest

JOURNAL ARTICLE published 31 July 2020 in ACM Transactions on Algorithms

Research funded by National Science Foundation (1464239, 1535887, 1218620, 1540547, 1910565) | Israel Science Foundation (1002/14,621/12) | Israeli Centers for Research Excellence (4/11)

Authors: Eden Chlamtáč | Michael Dinitz | Guy Kortsarz | Bundit Laekhanukit

https://doi.org/10.1145/3381451 Actions

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem

JOURNAL ARTICLE published 30 April 2018 in ACM Transactions on Algorithms

Research funded by Academy of Finland (274977) | Slovenian Research Agency (I0-0035, P1-0285, N1-0032, N1-0038, N1-0062, J1-6720, J1-7051)

Authors: Ademir Hujdurović | Edin Husić | Martin Milanić | Romeo Rizzi | Alexandru I. Tomescu

https://doi.org/10.1145/3182178 Actions

Competitive analysis of flash memory algorithms

JOURNAL ARTICLE published March 2011 in ACM Transactions on Algorithms

Authors: Avraham Ben-Aroya | Sivan Toledo

https://doi.org/10.1145/1921659.1921669 Actions

An approximation algorithm for the maximum leaf spanning arborescence problem

JOURNAL ARTICLE published June 2010 in ACM Transactions on Algorithms

Research funded by Natural Sciences and Engineering Research Council of Canada (28833-04) | Fonds Québécois de la Recherche sur la Nature et les Technologies (NC-98649)

Authors: Matthew Drescher | Adrian Vetta

https://doi.org/10.1145/1798596.1798599 Actions

Reliable Spanners for Metric Spaces

JOURNAL ARTICLE published 31 January 2023 in ACM Transactions on Algorithms

Research funded by NSF AF (CCF-1907400) | BSF (2018223) | Netherlands Organisation for Scientific Research (024.002.003)

Authors: Sariel Har-Peled | Manor Mendel | Dániel Oláh

https://doi.org/10.1145/3563356 Actions

On the set multicover problem in geometric settings

JOURNAL ARTICLE published December 2012 in ACM Transactions on Algorithms

Research funded by Division of Computing and Communication Foundations (CCF-0728782, CNS-0721899 and CCF-0915984) | Division of Computer and Network Systems (CCF-0728782, CNS-0721899 and CCF-0915984)

Authors: Chandra Chekuri | Kenneth L. Clarkson | Sariel Har-Peled

https://doi.org/10.1145/2390176.2390185 Actions

Testing Euclidean minimum spanning trees in the plane

JOURNAL ARTICLE published June 2008 in ACM Transactions on Algorithms

Research funded by Deutsche Forschungsgemeinschaft (Me872/8-3) | University of Warwick (EP/DO63191/1) | National Science Foundation (ITR-CCR-0313219CCR-0105701) | Engineering and Physical Sciences Research Council (EP/DO63191/1)

Authors: Artur Czumaj | Christian Sohler

https://doi.org/10.1145/1367064.1367071 Actions

Linear time 3-approximation for the MAST problem

JOURNAL ARTICLE published March 2009 in ACM Transactions on Algorithms

Authors: Vincent Berry | Christophe Paul | Sylvain Guillemot | François Nicolas

https://doi.org/10.1145/1497290.1497299 Actions

On approximating multicriteria TSP

JOURNAL ARTICLE published April 2012 in ACM Transactions on Algorithms

Authors: Bodo Manthey

https://doi.org/10.1145/2151171.2151180 Actions

Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ

JOURNAL ARTICLE published October 2006 in ACM Transactions on Algorithms

Authors: William Evans | David Kirkpatrick

https://doi.org/10.1145/1198513.1198523 Actions

Individual displacements for linear probing hashing with different insertion policies

JOURNAL ARTICLE published October 2005 in ACM Transactions on Algorithms

Authors: Svante Janson

https://doi.org/10.1145/1103963.1103964 Actions

Problems column

JOURNAL ARTICLE published January 2006 in ACM Transactions on Algorithms

Authors: Samir Khuller

https://doi.org/10.1145/1125994.1126002 Actions

Analysis of linear combination algorithms in cryptography

JOURNAL ARTICLE published July 2005 in ACM Transactions on Algorithms

Authors: Peter J. Grabner | Clemens Heuberger | Helmut Prodinger | Jörg M. Thuswaldner

https://doi.org/10.1145/1077464.1077473 Actions
Feedback: support@crossref.org