The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (DBLP): http://dblp.uni-trier.de/db/journals/jacm

Publication years (Num. hits)
1954 (21) 1955 (22) 1956 (37) 1957 (51) 1958 (39) 1959 (50) 1960 (40) 1961 (49) 1962 (41) 1963 (49) 1964 (43) 1965 (58) 1966 (55) 1967 (64) 1968 (52) 1969 (57) 1970 (63) 1971 (52) 1972 (55) 1973 (54) 1974 (64) 1975 (53) 1976 (67) 1977 (51) 1978 (57) 1979 (57) 1980 (61) 1981 (52) 1982 (64) 1983 (51) 1984 (52) 1985 (51) 1986 (39) 1987 (48) 1988 (48) 1989 (42) 1990 (36) 1991 (37) 1992 (38) 1993 (45) 1994 (47) 1995 (44) 1996 (32) 1997 (34) 1998 (31) 1999 (27) 2000 (35) 2001 (38) 2002 (31) 2003 (53) 2004 (33) 2005 (30) 2006 (31) 2007 (32) 2008 (28) 2009 (38) 2010 (34) 2011 (26) 2012 (32) 2013 (45) 2014 (41) 2015 (51) 2016 (49) 2017 (48) 2018 (48) 2019 (23)
Publication types (Num. hits)
article(2926)
Venues (Conferences, Journals, ...)
J. ACM(2926)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2054 occurrences of 1145 keywords

Results
Found 2926 publication records. Showing 2926 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Mahdi Cheraghchi Capacity Upper Bounds for Deletion-type Channels. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ankur Moitra Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner 0001 Shellability is NP-complete. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Heng Guo 0001, Mark Jerrum, Jingcheng Liu 0001 Uniform Sampling Through the Lovász Local Lemma. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vera Traub, Jens Vygen Approaching 3/2 for the s-t-path TSP. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nikhil R. Devanur, Kamal Jain, Balasubramanian Sivan, Christopher A. Wilkens Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Paul Beame, Vincent Liew Toward Verifying Nonlinear Integer Arithmetic. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell 0001 On the Decidability of Membership in Matrix-exponential Semigroups. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ran Raz Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Articles Foreword. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Mikkel Thorup Deterministic Edge Connectivity in Near-Linear Time. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Victor Bushkov, Dmytro Dziuma, Panagiota Fatourou, Rachid Guerraoui The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Steve Bishop, Matthew Fairbairn, Hannes Mehnert, Michael Norrish, Tom Ridge, Peter Sewell, Michael Smith 0008, Keith Wansbrough Engineering with Logic: Rigorous Test-Oracle Specification and Validation for TCP/IP and the Sockets API. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Ferrère, Oded Maler, Dejan Nickovic, Amir Pnueli From Real-time Logic to Timed Automata. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Daniel M. Kane, Shachar Lovett, Shay Moran Near-optimal Linear Decision Trees for k-SUM and Related Problems. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy 0001 On the Computability of Conditional Probability. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thomas Place, Marc Zeitoun Going Higher in First-Order Quantifier Alternation Hierarchies on Words. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Russell Impagliazzo, Raghu Meka, David Zuckerman Pseudorandomness from Shrinkage. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre Fraigniaud, Amos Korman, Yoav Rodeh Parallel Bayesian Search with No Coordination. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh 0001 Exact Algorithms via Monotone Local Search. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Peter Bürgisser, Felipe Cucker, Pierre Lairez Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vincent Rahli, Mark Bickford, Liron Cohen 0001, Robert L. Constable Bar Induction is Compatible with Constructive Type Theory. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Konstantin Makarychev, Maxim Sviridenko Solving Optimization Problems with Diseconomies of Scale via Decoupling. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Helmut Seidl, Sebastian Maneth, Gregor Kemper Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Wojciech Czerwinski, Wim Martens, Matthias Niewerth, Pawel Parys Minimization of Tree Patterns. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Martín Abadi, Bruno Blanchet, Cédric Fournet The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Virginia Vassilevska Williams, R. Ryan Williams Subcubic Equivalences Between Path, Matrix, and Triangle Problems. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jirí Matousek 0001, Eric Sedgwick, Martin Tancer, Uli Wagner 0001 Embeddability in the 3-Sphere Is Decidable. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Tim Roughgarden, Sergei Vassilvitskii, Joshua R. Wang Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation). Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Article Foreword. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Itay Berman, Iftach Haitner, Aris Tentes Coin Flipping of Any Constant Bias Implies One-Way Functions. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ethan L. Schreiber, Richard E. Korf, Michael D. Moffitt Optimal Multi-Way Number Partitioning. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1James P. Delgrande, Pavlos Peppas, Stefan Woltran General Belief Revision. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Stefan Kratsch, Jesper Nederlof Fast Hamiltonicity Checking Via Bases of Perfect Matchings. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hung Q. Ngo 0001, Ely Porat, Christopher Ré, Atri Rudra Worst-case Optimal Join Algorithms. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Samir Datta, Raghav Kulkarni, Anish Mukherjee 0001, Thomas Schwentick, Thomas Zeume Reachability Is in DynFO. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1T.-H. Hubert Chan, Anand Louis, Zhihao Gavin Tang, Chenzi Zhang Spectral Properties of Hypergraph Laplacian and Approximation Algorithms. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Haifeng Yu, Yuda Zhao, Irvan Jahja The Cost of Unknown Diameter in Dynamic Networks. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Article Foreword. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emil Stefanov, Marten van Dijk, Elaine Shi, T.-H. Hubert Chan, Christopher W. Fletcher, Ling Ren 0001, Xiangyao Yu, Srinivas Devadas Path ORAM: An Extremely Simple Oblivious RAM Protocol. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Article Foreword. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001 Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Federico Olmedo Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi Rumor Spreading and Conductance. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David Kurokawa, Ariel D. Procaccia, Junxing Wang Fair Enough: Guaranteeing Approximate Maximin Shares. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Manuel Bodirsky, Barnaby Martin, Antoine Mottet Discrete Temporal Constraint Satisfaction Problems. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1David G. Harris, Johannes Schneider, Hsin-Hao Su Distributed (Δ +1)-Coloring in Sublogarithmic Rounds. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Moshe Babaioff, Nicole Immorlica, David Kempe 0001, Robert Kleinberg Matroid Secretary Problems. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Allan Grønlund, Seth Pettie Threesomes, Degenerates, and Love Triangles. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ashwinkumar Badanidiyuru, Robert Kleinberg, Aleksandrs Slivkins Bandits with Knapsacks. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky Characterizing Transactional Memory Consistency Conditions Using Observational Refinement. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Xi Chen 0001, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie Settling the Query Complexity of Non-adaptive Junta Testing. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Florian Brandl, Felix Brandt 0001, Manuel Eberl, Christian Geist Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Ehrhard, Michele Pagani, Christine Tasson Full Abstraction for Probabilistic PCF. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Andrea Cerone, Alexey Gotsman Analysing Snapshot Isolation. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stephan Friedrichs, Christoph Lenzen Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Michael Molloy The Freezing Threshold for k-Colourings of a Random Graph. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Article Foreword. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam On Algebraic Branching Programs of Small Width. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bingkai Lin The Parameterized Complexity of the k-Biclique Problem. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sungjin Im, Janardhan Kulkarni, Kamesh Munagala Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Article Foreword. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Nir Bitansky, Vinod Vaikuntanathan Indistinguishability Obfuscation from Functional Encryption. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joshua A. Grochow, Toniann Pitassi Circuit Complexity, Proof Complexity, and Polynomial Identity Testing: The Ideal Proof System. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wichs Non-Malleable Codes. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Armando Castañeda, Sergio Rajsbaum, Michel Raynal Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul Beame, Paraschos Koutris, Dan Suciu Communication Steps for Parallel Query Processing. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Aleksandr Karbyshev, Nikolaj Bjørner, Shachar Itzhaky, Noam Rinetzky, Sharon Shoham Property-Directed Inference of Universal Invariants or Proving Their Absence. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andreas Galanis, Andreas Göbel 0001, Leslie Ann Goldberg, John Lapinskas, David Richerby Amplifiers for the Moran Process. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benny Applebaum, Jonathan Avron, Chris Brzuska Arithmetic Cryptography. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen Optimal Induced Universal Graphs and Adjacency Labeling for Trees. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Parosh Aziz Abdulla, Stavros Aronis, Bengt Jonsson, Konstantinos Sagonas Source Sets: A Foundation for Optimal Dynamic Partial Order Reduction. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Oded Goldreich 0001, Dana Ron On Learning and Testing Dynamic Environments. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pranjal Awasthi, Maria-Florina Balcan, Philip M. Long The Power of Localization for Efficiently Learning Linear Separators with Noise. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Hubie Chen The Tractability Frontier of Graph-Like First-Order Query Sets. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rajeev Alur, Loris D'Antoni Streaming Tree Transducers. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amin Coja-Oghlan Belief Propagation Guided Decimation Fails on Random Formulas. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Vitaly Feldman, Elena Grigorescu, Lev Reyzin, Santosh Srinivas Vempala, Ying Xiao 0003 Statistical Algorithms and a Lower Bound for Detecting Planted Cliques. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rowan Davies A Temporal Logic Approach to Binding-Time Analysis. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Stephan Kreutzer, Sebastian Siebertz Deciding First-Order Properties of Nowhere Dense Graphs. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Johan Håstad, Benjamin Rossman, Rocco A. Servedio, Li-Yang Tan An Average-Case Depth Hierarchy Theorem for Boolean Circuits. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Margus Veanes, Nikolaj Bjørner, Lev Nachmanson, Sergey Bereg Monadic Decomposition. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ken-ichi Kawarabayashi, Mikkel Thorup Coloring 3-Colorable Graphs with Less than n1/5 Colors. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jin-Yi Cai, Xi Chen 0001 Complexity of Counting CSP with Complex Weights. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1David Harvey, Joris van der Hoeven, Grégoire Lecerf Faster Polynomial Multiplication over Finite Fields. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thomas Rothvoss The Matching Polytope has Exponential Extension Complexity. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, Kaspars Balodis, Aleksandrs Belovs, Troy Lee, Miklos Santha, Juris Smotrovs Separations in Query Complexity Based on Pointer Functions. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amir Abboud, Greg Bodwin The 4/3 Additive Spanner Exponent Is Tight. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala Tight Lower Bounds on Graph Embedding Problems. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Articles Foreword. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Gregory Valiant, Paul Valiant Estimating the Unseen: Improved Estimators for Entropy and Other Properties. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Éva Tardos Invited Articles Foreword. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2926 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license