Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/toc/toc8.bht:"
download as .bib file
@article{DBLP:journals/toc/AnagnostopoulosDK12,
author = {Aris Anagnostopoulos and
Anirban Dasgupta and
Ravi Kumar},
title = {A Constant-Factor Approximation Algorithm for Co-clustering},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {597--622},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a026},
doi = {10.4086/TOC.2012.V008A026},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/AnagnostopoulosDK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/AroraHK12,
author = {Sanjeev Arora and
Elad Hazan and
Satyen Kale},
title = {The Multiplicative Weights Update Method: a Meta-Algorithm and Applications},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {121--164},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a006},
doi = {10.4086/TOC.2012.V008A006},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/AroraHK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BahmaniMM12,
author = {Bahman Bahmani and
Aranyak Mehta and
Rajeev Motwani},
title = {Online Graph Edge-Coloring in the Random-Order Arrival Model},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {567--595},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a025},
doi = {10.4086/TOC.2012.V008A025},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BahmaniMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BansalCKP12,
author = {Nikhil Bansal and
Ho{-}Leung Chan and
Dmitriy Katz and
Kirk Pruhs},
title = {Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root
Rule},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {209--229},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a009},
doi = {10.4086/TOC.2012.V008A009},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/BansalCKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BansalKNS12,
author = {Nikhil Bansal and
Nitish Korula and
Viswanath Nagarajan and
Aravind Srinivasan},
title = {Solving Packing Integer Programs via Randomized Rounding with Alterations},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {533--565},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a024},
doi = {10.4086/TOC.2012.V008A024},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/BansalKNS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BansalW12,
author = {Nikhil Bansal and
Ryan Williams},
title = {Regularity Lemmas and Combinatorial Algorithms},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {69--94},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a004},
doi = {10.4086/TOC.2012.V008A004},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/BansalW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BenabbasGMT12,
author = {Siavosh Benabbas and
Konstantinos Georgiou and
Avner Magen and
Madhur Tulsiani},
title = {{SDP} Gaps from Pairwise Independence},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {269--289},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a012},
doi = {10.4086/TOC.2012.V008A012},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BenabbasGMT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BhattacharyaGGM12,
author = {Sayan Bhattacharya and
Gagan Goel and
Sreenivas Gollapudi and
Kamesh Munagala},
title = {Budget-Constrained Auctions with Heterogeneous Items},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {429--460},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a020},
doi = {10.4086/TOC.2012.V008A020},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BhattacharyaGGM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BuhrmanRSW12,
author = {Harry Buhrman and
Oded Regev and
Giannicola Scarpa and
Ronald de Wolf},
title = {Near-Optimal and Explicit Bell Inequality Violations},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {623--645},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a027},
doi = {10.4086/TOC.2012.V008A027},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BuhrmanRSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChekuriIM12,
author = {Chandra Chekuri and
Sungjin Im and
Benjamin Moseley},
title = {Online Scheduling to Minimize Maximum Response Time and Maximum Delay
Factor},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {165--195},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a007},
doi = {10.4086/TOC.2012.V008A007},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChekuriIM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChuzhoyK12,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {An O(k\({}^{\mbox{3}}\)log n)-Approximation Algorithm for Vertex-Connectivity
Survivable Network Design},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {401--413},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a018},
doi = {10.4086/TOC.2012.V008A018},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChuzhoyK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/DughmiRS12,
author = {Shaddin Dughmi and
Tim Roughgarden and
Mukund Sundararajan},
title = {Revenue Submodularity},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {95--119},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a005},
doi = {10.4086/TOC.2012.V008A005},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/DughmiRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/FelzenszwalbH12,
author = {Pedro F. Felzenszwalb and
Daniel P. Huttenlocher},
title = {Distance Transforms of Sampled Functions},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {415--428},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a019},
doi = {10.4086/TOC.2012.V008A019},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/FelzenszwalbH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Gall12,
author = {Fran{\c{c}}ois Le Gall},
title = {Quantum Private Information Retrieval with Sublinear Communication
Complexity},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {369--374},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a016},
doi = {10.4086/TOC.2012.V008A016},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Gall12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GoelP12,
author = {Ashish Goel and
Ian Post},
title = {One Tree Suffices: {A} Simultaneous O(1)-Approximation for Single-Sink
Buy-at-Bulk},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {351--368},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a015},
doi = {10.4086/TOC.2012.V008A015},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GoelP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GoldreichI12,
author = {Oded Goldreich and
Rani Izsak},
title = {Monotone Circuits: One-Way Functions versus Pseudorandom Generators},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {231--238},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a010},
doi = {10.4086/TOC.2012.V008A010},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GoldreichI12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GuruswamiZ12,
author = {Venkatesan Guruswami and
Yuan Zhou},
title = {Tight Bounds on the Approximability of Almost-Satisfiable Horn {SAT}
and Exact Hitting Set},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {239--267},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a011},
doi = {10.4086/TOC.2012.V008A011},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/GuruswamiZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Har-PeledIM12,
author = {Sariel Har{-}Peled and
Piotr Indyk and
Rajeev Motwani},
title = {Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {321--350},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a014},
doi = {10.4086/TOC.2012.V008A014},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Har-PeledIM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HavivR12,
author = {Ishay Haviv and
Oded Regev},
title = {Tensor-based Hardness of the Shortest Vector Problem to within Almost
Polynomial Factors},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {513--531},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a023},
doi = {10.4086/TOC.2012.V008A023},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HavivR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/JainKKSSZ12,
author = {Rahul Jain and
Iordanis Kerenidis and
Greg Kuperberg and
Miklos Santha and
Or Sattath and
Shengyu Zhang},
title = {On the Power of a Unique Quantum Witness},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {375--400},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a017},
doi = {10.4086/TOC.2012.V008A017},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/JainKKSSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/KasherK12,
author = {Roy Kasher and
Julia Kempe},
title = {Two-Source Extractors Secure Against Quantum Adversaries},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {461--486},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a021},
doi = {10.4086/TOC.2012.V008A021},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/KasherK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/KhullerG12,
author = {Samir Khuller and
Sudipto Guha},
title = {Special Issue in Honor of Rajeev Motwani {(1962-2009):} Guest Editors'
Foreword},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {53--54},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a002},
doi = {10.4086/TOC.2012.V008A002},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/KhullerG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/MelkebeekW12,
author = {Dieter van Melkebeek and
Thomas Watson},
title = {Time-Space Efficient Simulations of Quantum Computations},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {1--51},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a001},
doi = {10.4086/TOC.2012.V008A001},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/MelkebeekW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Micciancio12,
author = {Daniele Micciancio},
title = {Inapproximability of the Shortest Vector Problem: Toward a Deterministic
Reduction},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {487--512},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a022},
doi = {10.4086/TOC.2012.V008A022},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/Micciancio12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Raghavan12,
author = {Prabhakar Raghavan},
title = {Rajeev Motwani {(1962-2009)}},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {55--68},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a003},
doi = {10.4086/TOC.2012.V008A003},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Raghavan12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ReichardtS12,
author = {Ben Reichardt and
Robert Spalek},
title = {Span-Program-Based Quantum Algorithm for Evaluating Formulas},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {291--319},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a013},
doi = {10.4086/TOC.2012.V008A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ReichardtS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Sherstov12,
author = {Alexander A. Sherstov},
title = {The Communication Complexity of Gap Hamming Distance},
journal = {Theory Comput.},
volume = {8},
number = {1},
pages = {197--208},
year = {2012},
url = {https://doi.org/10.4086/toc.2012.v008a008},
doi = {10.4086/TOC.2012.V008A008},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Sherstov12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-04 14:10 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
