Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,115,631 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
On the Constant Price of Anarchy Conjecture
Carme Àlvarez
,
A. Messegué
arXiv.org
2018
Corpus ID: 52334469
We study Nash equilibria and the price of anarchy in the classic model of Network Creation Games introduced by Fabrikant et al…
Expand
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
2016
2016
Structural sparseness and complex networks
F. Reidl
2016
Corpus ID: 39368113
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…
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
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
2015
2015
An improved lower bound for one-dimensional online unit clustering
J. Kawahara
,
Koji M. Kobayashi
Theoretical Computer Science
2015
Corpus ID: 8358260
2013
2013
Adaptive and Approximate Orthogonal Range Counting
Timothy M. Chan
,
Bryan T. Wilkinson
ACM-SIAM Symposium on Discrete Algorithms
2013
Corpus ID: 12743234
We present three new results on one of the most basic problems in geometric data structures, 2-D orthogonal range counting. All…
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
2004
2004
Querying priced information in databases: The conjunctive case
E. Laber
,
R. Carmo
,
Y. Kohayakawa
TALG
2004
Corpus ID: 1413146
Query optimization that involves expensive predicates has received considerable attention in the database community. Typically…
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