Conferences in DBLP
Frank Thomson Leighton How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty. [Citation Graph (0, 0)][DBLP ] Conf ] Nancy A. Lynch , Sergio Rajsbaum On the Borowsky-Gafni Simulation Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Paolo Boldi , Shella Shammah , Sebastiano Vigna , Bruno Codenotti , Peter Gemmell , Janos Simon Symmetry Breaking in Anonymous Networks: Characterizations. [Citation Graph (0, 0)][DBLP ] Conf ] Shlomi Dolev , Evangelos Kranakis , Danny Krizanc Baked Potato Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Baruch Awerbuch , Yossi Azar , Amos Fiat Packet Routing via Min-Cost Circuit Routing. [Citation Graph (0, 0)][DBLP ] Conf ] Micha Sharir Arrangements of Curves and Surfaces in Computational Geometry. [Citation Graph (0, 0)][DBLP ] Conf ] Y. B. Karasik On Advances in Optical Computational Models and Problems which They Help to Solve. [Citation Graph (0, 0)][DBLP ] Conf ] Viggo Kann , Sanjeev Khanna , Jens Lagergren , Alessandro Panconesi On the Hardness of Approximating Max k-Cut and Its Dual. [Citation Graph (0, 0)][DBLP ] Conf ] Pierluigi Crescenzi , Riccardo Silvestri , Luca Trevisan To Weight or Not to Weight: Where is the Question? [Citation Graph (0, 0)][DBLP ] Conf ] Guy Even , Joseph Naor , Baruch Schieber , Leonid Zosin Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Shimon Ullman Visual Object Recognition. [Citation Graph (0, 0)][DBLP ] Conf ] Silvia M. Müller , Wolfgang J. Paul Making the Original Scoreboard Mechanism Deadlock Free. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Cadoli , Francesco M. Donini , Paolo Liberatore , Marco Schaerf Feasibility and Unfeasibility of Off-Line Processing. [Citation Graph (0, 0)][DBLP ] Conf ] Judit Bar-Ilan , Guy Kortsarz , David Peleg Generalized Submodular Cover Problems and Applications. [Citation Graph (0, 0)][DBLP ] Conf ] Amotz Bar-Noy , Hadas Shachnai , Tami Tamir On Chromatic Sums and Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP ] Conf ] Stuart W. Margolis , Mark V. Sapir , Pascal Weil On the Indecomposibility of Certain Language Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Codish , Vitaly Lagoon Type Dependencies for Logic Programs Using ACI-Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Altenkirch , Martin Hofmann , Thomas Streicher Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP ] Conf ] Cees Witteveen , Wiebe van der Hoek Updating Nonmonotonic Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander E. Andreev , Andrea E. F. Clementi , José D. P. Rolim On the Parallel Computation of Boolean Functions on Unrelated inputs. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Zippel On Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Yishay Mansour , Michal Parnas On Learning Conjunctions with Malicious Noise. [Citation Graph (0, 0)][DBLP ] Conf ] Moni Naor , Sitvanit Ruah On the Decisional Complexity of Problems Over the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] William R. Pulleyblank The Airline Crew Pairing Optimization Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Benny Chor , Yuval Ishai On Privacy and Partition Arguments. [Citation Graph (0, 0)][DBLP ] Conf ] Haim Kaplan , Ron Shamir Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. [Citation Graph (0, 0)][DBLP ] Conf ] Roded Sharan , Avi Wigderson A New NC Algorithm for Perfect Matching in Bipartite Cubic Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Uriel Feige , Yuri Rabinovich Deterministic Approximation of the Cover Time. [Citation Graph (0, 0)][DBLP ] Conf ] Israel A. Wagner , Michael Lindenbaum , Alfred M. Bruckstein Smell as a Computational Resource - A Lesson We Can Learn from the Ant. [Citation Graph (0, 0)][DBLP ] Conf ] 