Search results for "J. ACM"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Victor Vianu	Invited article foreword.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Christel Baier, Marcus Größer, Nathalie Bertrand	Probabilistic ω-automata.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Vijay V. Vazirani	The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Oded Goldreich, Brendan Juba, Madhu Sudan	A theory of goal-oriented communication.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang	Continuous sampling from distributed streams.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Armando Castañeda, Sergio Rajsbaum	New combinatorial topology bounds for renaming: The upper bound.	J. ACM	2012	DBLP DOI BibTeX RDF
1	James Aspnes, Hagit Attiya, Keren Censor-Hillel	Polylogarithmic concurrent data structures from monotone circuits.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Martin Otto	Highly acyclic groups, hypergraph covers, and the guarded fragment.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Victor Vianu	Invited article foreword.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, Ke Yang	On the (im)possibility of obfuscating programs.	J. ACM	2012	DBLP DOI BibTeX RDF
1	Ronald Fagin, Benny Kimelfeld, Phokion G. Kolaitis	Probabilistic data exchange.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Victor Vianu	Invited Article Foreword.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Monaldo Mastrolilli, Ola Svensson	Hardness of Approximating Flow and Job Shop Scheduling Problems.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Leonid Barenboim, Michael Elkin	Deterministic Distributed Vertex Coloring in Polylogarithmic Time.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Ron Lavi, Chaitanya Swamy	Truthful and Near-Optimal Mechanism Design via Linear Programming.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Victor Vianu	Invited Articles Foreword.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Victor Vianu	Introduction to JACM invited article.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Kevin Buchin, Wolfgang Mulzer	Delaunay triangulations in O(sort(n)) time and more.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Bernard Chazelle, C. Seshadhri	Online geometric reconstruction.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Cristiano Calcagno, Dino Distefano, Peter W. O'Hearn, Hongseok Yang	Compositional Shape Analysis by Means of Bi-Abduction.	J. ACM	2011	DBLP DOI BibTeX RDF
1	David Arthur, Bodo Manthey, Heiko Röglin	Smoothed Analysis of the k-Means Method.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkhi, Alexander Shraer	Dynamic atomic storage without consensus.	J. ACM	2011	DBLP DOI BibTeX RDF
1	S. Dov Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell	Complete Fairness in Secure Two-Party Computation.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk, Pawel Parys	XPath evaluation in linear time.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Emmanuel J. Candès, Xiaodong Li, Yi Ma, John Wright	Robust principal component analysis?	J. ACM	2011	DBLP DOI BibTeX RDF
1	Bernhard Haeupler, Barna Saha, Aravind Srinivasan	New Constructive Aspects of the Lovász Local Lemma.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Victor Vianu	Invited articles foreword.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Ferdinando Cicalese, Eduardo Sany Laber	On the competitive ratio of evaluating priced functions.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous	QIP = PSPACE.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Haim Avron, Sivan Toledo	Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Vijay V. Vazirani, Mihalis Yannakakis	Market equilibrium under separable, piecewise-linear, concave utilities.	J. ACM	2011	DBLP DOI BibTeX RDF
1	MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx	Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Michael T. Goodrich	Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy	Estimating PageRank on graph streams.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Valerie King, Jared Saia	Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Christoph Lenzen, Thomas Locher, Roger Wattenhofer	Tight bounds for clock synchronization.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Boris Motik, Riccardo Rosati	Reconciling description logics and rules.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Sudipto Guha, Kamesh Munagala, Peng Shi	Approximation algorithms for restless bandit problems.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Balder ten Cate, Luc Segoufin	Transitive closure logic, nested tree walking automata, and XPath.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Kathleen Fisher, Yitzhak Mandelbaum, David Walker	The next 700 data description languages.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Alon Altman, Moshe Tennenholtz	An axiomatic approach to personalized ranking systems.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Pablo Barceló, Leonid Libkin, Antonella Poggi, Cristina Sirangelo	XML with incomplete information.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Georg Gottlob, Pierre Senellart	Schema mapping discovery from data instances.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson	Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue bounds, spectral partitioning, and metrical deformations via flows.	J. ACM	2010	DBLP DOI BibTeX RDF
1	David M. Blei, Thomas L. Griffiths, Michael I. Jordan	The nested chinese restaurant process and bayesian nonparametric inference of topic hierarchies.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Gabriel Nivasch	Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Mark Braverman	Polylogarithmic independence fools AC0 circuits.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Javier Esparza, Stefan Kiefer, Michael Luttenberger	Newtonian program analysis.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Tetsuo Shibuya	Geometric suffix tree: Indexing protein 3-D structures.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Timothy M. Chan	A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Ronald Fagin, Alan Nash	The structure of inverses in schema mappings.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Jan Kára	The complexity of temporal constraint satisfaction problems.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Shlomi Dolev, Yuval Elovici, Rami Puzis	Routing betweenness centrality.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Eric Allender, Michal Koucký	Amplifying lower bounds by means of self-reducibility.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Victor Vianu	Editorial: JACM at the start of a new decade.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Lawrence Mandow, José-Luis Pérez-de-la-Cruz	Multiobjective A* search with consistent heuristics.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Victor Vianu	Invited articles section foreword.	J. ACM	2010	DBLP DOI BibTeX RDF
1	T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar	Ultra-low-dimensional embeddings for doubling metrics.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Amit Kumar, Yogish Sabharwal, Sandeep Sen	Linear-time approximation schemes for clustering problems in any dimensions.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Dana Moshkovitz, Ran Raz	Two-query PCP with subconstant error.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui	Tight failure detection bounds on atomic object implementations.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen	Limitations of quantum coset states for graph isomorphism.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Santosh Vempala	A random-sampling-based algorithm for learning intersections of halfspaces.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Maria-Florina Balcan, Avrim Blum	A discriminative model for semi-supervised learning.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Alexandre V. Evfimievski, Ronald Fagin, David P. Woodruff	Epistemic privacy.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Robin A. Moser, Gábor Tardos	A constructive proof of the general lovász local lemma.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Prasad Chebolu, Alan M. Frieze, Páll Melsted	Finding a maximum matching in a sparse random graph in O(n) expected time.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Witold Charatonik, Leszek Pacholski	Set constraints with projections.	J. ACM	2010	DBLP DOI BibTeX RDF
1	Moshe Babaioff, Ron Lavi, Elan Pavlov	Single-value combinatorial auctions and algorithmic implementation in undominated strategies.	J. ACM	2009	DBLP DOI BibTeX RDF	undominated strategies, mechanism design, incentives, Combinatorial auctions
1	Sanjeev Arora, Satish Rao, Umesh V. Vazirani	Expander flows, geometric embeddings and graph partitioning.	J. ACM	2009	DBLP DOI BibTeX RDF	Graph partitioning, semidefinite programs, multicommodity flows, expanders, expansion, graph separators
1	Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik	On approximating the ideal random access machine by physical machines.	J. ACM	2009	DBLP DOI BibTeX RDF	Physical constraints on machines, pipelined hierarchical memory, speculative processors
1	Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham	Empirical hardness models: Methodology and a case study on combinatorial auctions.	J. ACM	2009	DBLP DOI BibTeX RDF	Empirical analysis of algorithms, algorithm portfolios, runtime prediction, combinatorial auctions
1	Leonid Libkin, Victor Vianu	Introduction to PODS 2007 special section.	J. ACM	2009	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin	Two-variable logic on data trees and XML reasoning.	J. ACM	2009	DBLP DOI BibTeX RDF	XML, consistency, Integrity constraints, DTDs, implications
1	Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen	A property of quantum relative entropy with an application to privacy in quantum communication.	J. ACM	2009	DBLP DOI BibTeX RDF	quantum communication complexity, Privacy, quantum information theory
1	Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch	A measure & conquer approach for the analysis of exact algorithms.	J. ACM	2009	DBLP DOI BibTeX RDF	Dominating set, exact algorithm, independent set
1	Glencora Borradaile, Philip N. Klein	An O(n log n) algorithm for maximum st-flow in a directed planar graph.	J. ACM	2009	DBLP DOI BibTeX RDF	planar graphs, Maximum flow
1	Dimitris Achlioptas, Aaron Clauset, David Kempe, Cristopher Moore	On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs.	J. ACM	2009	DBLP DOI BibTeX RDF	sampling bias, Internet topology, traceroute
1	Martin Grohe, André Hernich, Nicole Schweikardt	Lower bounds for processing data with few random accesses to external memory.	J. ACM	2009	DBLP DOI BibTeX RDF	real-time data, XML, Complexity, query processing, data streams, query optimization, semi-structured data
1	Moni Naor, Guy N. Rothblum	The complexity of online memory checking.	J. ACM	2009	DBLP DOI BibTeX RDF	Memory checking, authentication
1	Venkatesan Guruswami, Christopher Umans, Salil P. Vadhan	Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes.	J. ACM	2009	DBLP DOI BibTeX RDF	error-correcting codes, Expander graphs, condensers, list decoding, randomness extractors
1	Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan	On the expressiveness and complexity of randomization in finite state monitors.	J. ACM	2009	DBLP DOI BibTeX RDF	topology, randomization, runtime verification, probabilistic automata, Omega automata
1	Georg Gottlob, Zoltán Miklós, Thomas Schwentick	Generalized hypertree decompositions: NP-hardness and tractable variants.	J. ACM	2009	DBLP DOI BibTeX RDF	TreeProjection Problem, hypertree decomposition, NP-complete, hypergraph, Conjunctive query, tractable, acyclic
1	Sunil Arya, Theocharis Malamatos, David M. Mount	Space-time tradeoffs for approximate nearest neighbor searching.	J. ACM	2009	DBLP DOI BibTeX RDF
1	Ran Raz	Multi-linear formulas for permanent and determinant are of super-polynomial size.	J. ACM	2009	DBLP DOI BibTeX RDF	arithmetic formulas, lower bounds, circuit complexity, algebraic complexity
1	Markus Püschel, Peter A. Milder, James C. Hoe	Permuting streaming data using RAMs.	J. ACM	2009	DBLP DOI BibTeX RDF	data reordering, linear bit mapping, streaming datapath, stride permutation, Permutation, switch, RAM, connection network, matrix transposition
1	Jon M. Kleinberg, Aleksandrs Slivkins, Tom Wexler	Triangulation and embedding using small sets of beacons.	J. ACM	2009	DBLP DOI BibTeX RDF	Distributed algorithms, embeddings, triangulation, metric spaces, doubling dimension
1	Victor Vianu, Jan Van den Bussche	Introduction to PODS 2006 special section.	J. ACM	2009	DBLP DOI BibTeX RDF
1	Jonathan Katz, Rafail Ostrovsky, Moti Yung	Efficient and secure authenticated key exchange using weak passwords.	J. ACM	2009	DBLP DOI BibTeX RDF
1	Leslie G. Valiant	Evolvability.	J. ACM	2009	DBLP DOI BibTeX RDF	SQ learning, Evolvable, PAC learning
1	Oded Regev	On lattices, learning with errors, random linear codes, and cryptography.	J. ACM	2009	DBLP DOI BibTeX RDF	average-case hardness, cryptography, quantum computation, Lattice, public key encryption
1	V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan	A unified approach to scheduling on unrelated parallel machines.	J. ACM	2009	DBLP DOI BibTeX RDF	scheduling under multiple criteria, Approximation algorithms, randomized rounding
1	Xi Chen, Xiaotie Deng, Shang-Hua Teng	Settling the complexity of computing two-player Nash equilibria.	J. ACM	2009	DBLP DOI BibTeX RDF	Arrow-Debreu market, Brouwer's fixed point, Lemke-Howson algorithm, PPAD-completeness, Sperner's lemma, Nash equilibrium, smoothed analysis, Two-player game
1	Rajeev Alur, P. Madhusudan	Adding nesting structure to words.	J. ACM	2009	DBLP DOI BibTeX RDF	software model checking, tree automata, Pushdown automata, XML processing
1	Rohit Khandekar, Satish Rao, Umesh V. Vazirani	Graph partitioning using single commodity flows.	J. ACM	2009	DBLP DOI BibTeX RDF	Edge-separator, single commodity max-flow, sparse cut, spectral method
1	George S. Lueker	Improved bounds on the average length of longest common subsequences.	J. ACM	2009	DBLP DOI BibTeX RDF	Arratia-Steele conjecture, dynamic programming, average-case analysis, Longest common subsequences
1	Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, S. Muthukrishnan	Compressing and indexing labeled trees, with applications.	J. ACM	2009	DBLP DOI BibTeX RDF
1	Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov	The complexity of obstruction-free implementations.	J. ACM	2009	DBLP DOI BibTeX RDF	perturbable objects, solo-fast implementations, step contention, lower bounds, Shared memory, memory contention

Publications at "J. ACM"( http://dblp.L3S.de/Venues/J._ACM )