Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,502,021 papers from all fields of science
Search
Sign In
Create Free Account
ACM Transactions on Algorithms
ACM Transactions on Algorithms (TALG) is a quarterly peer-reviewed scientific journal covering the field of algorithms. It was established in 2005…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithmica
Algorithms
Clique-width
Current Contents
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs
R. Chowdhury
,
V. Ramachandran
ACM Trans. Algorithms
2018
Corpus ID: 3435480
We present the buffer heap, a cache-oblivious priority queue that supports Delete-Min, Delete, and a hybrid Insert/Decrease-Key…
Expand
2018
2018
SIGACT News Online Algorithms Column 33
R. V. Stee
SIGA
2018
Corpus ID: 3973661
For this issue, Matthias Englert has contributed an alternative and simpler proof of a result by Gamzu and Segev, which was in…
Expand
2016
2016
A Simple and Efficient Algorithm for Computing Market Equilibria
L. Fleischer
,
R. Garg
,
S. Kapoor
,
R. Khandekar
,
A. Saberi
ACM Trans. Algorithms
2016
Corpus ID: 15078235
We give a new mathematical formulation of market equilibria in exchange economies using an indirect utility function: the…
Expand
2015
2015
An improved lower bound for one-dimensional online unit clustering
J. Kawahara
,
Koji M. Kobayashi
Theoretical Computer Science
2015
Corpus ID: 8358260
2015
2015
Randomized Jumplists With Several Jump Pointers
Elisabeth Neumann
2015
Corpus ID: 55263702
In 2003, a dictionary data structure called jumplist has been introduced by Bronnimann, Cazals and Durand. It is based on a…
Expand
2014
2014
Loose coupling and substitution principle in objet-oriented frameworks for web services. (Couplage faible et principe de substitution dans les environnements à objets pour les services web)
Diana Allam
2014
Corpus ID: 28531484
Today, the implementation of services (SOAP and RESTful models) and of client applications is increasingly based on object…
Expand
2011
2011
Routage compact optimal dans les (k, r)-constellations
Youssouf Dieng
,
C. Gavoille
Techniques et sciences informatiques
2011
Corpus ID: 41657888
\cite{FG01a} and independently \cite{TZ01} show that $n$-node trees support routing schemes with message headers, node addresses…
Expand
2009
2009
The Maximum Induced Matching Problem for Some Subclasses of Weakly Chordal Graphs
C. M. Krishnamurthy
2009
Corpus ID: 123810730
THE MAXIMUM INDUCED MATCHING PROBLEM FOR SOME SUBCLASSES OF WEAKLY CHORDAL GRAPHS Name: Krishnamurthy, Chandra Mohan University…
Expand
2008
2008
Parameterized Algorithms for Partial Cover Problems
O. Amini
,
F. Fomin
,
Saket Saurabh
arXiv.org
2008
Corpus ID: 11850351
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input…
Expand
2008
2008
Violation Heaps: A Better Substitute for Fibonacci Heaps
Amr Elmasry
arXiv.org
2008
Corpus ID: 10307569
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE