| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Paul Beame, Trinh Huynh |
The Value of Multiple Read/Write Streams for Approximating Frequency Moments.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Trinh Huynh |
Multiparty Communication Complexity and Threshold Circuit Size of sfAC0. |
SIAM J. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Christopher Beck, Russell Impagliazzo |
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Chris Beck, Russell Impagliazzo |
Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Henry A. Kautz, Ashish Sabharwal |
Towards Understanding and Harnessing the Potential of Clause Learning |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Widad Machmouchi |
Making Branching Programs Oblivious Requires Superlogarithmic Overhead. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind |
Formula Caching in DPLL. |
TOCT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Widad Machmouchi |
Making RAMs Oblivious Requires Superlogarithmic Overhead. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel |
Separating Deterministic from Randomized Multiparty Communication Complexity. |
Theory of Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Widad Machmouchi |
The Quantum Query Complexity of AC0 |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Trinh Huynh, Toniann Pitassi |
Hardness amplification in proof complexity. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
communication complexity, proof complexity |
| 1 | Paul Beame, Trinh Huynh |
Hardness Amplification in Proof Complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Amit Chakrabarti |
Special Issue "Conference on Computational Complexity 2008" Guest Editors' Foreword. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Trinh Huynh, Toniann Pitassi |
Hardness Amplification in Proof Complexity |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Dang-Trinh Huynh-Ngoc |
Multiparty Communication Complexity and Threshold Circuit Size of AC^0. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
lower bounds, communication complexity, constant-depth circuits |
| 1 | Paul Beame, Dang-Trinh Huynh-Ngoc |
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Dang-Trinh Huynh-Ngoc |
Multiparty Communication Complexity and Threshold Circuit Size of AC^0. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Dang-Trinh Huynh-Ngoc |
Multiparty Communication Complexity of AC^0. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Dang-Trinh Huynh-Ngoc |
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Ashish Sabharwal |
The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17 |
| 1 | Paul Beame, Toniann Pitassi, Nathan Segerlind |
Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tian Sang, Paul Beame, Henry A. Kautz |
A Dynamic Approach for MPE and Weighted MAX-SAT. |
IJCAI |
2007 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel |
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, T. S. Jayram, Atri Rudra |
Lower bounds for randomized read/write stream algorithms. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
communication complexity, data stream algorithms |
| 1 | Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind |
Formula Caching in DPLL. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson |
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. |
Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10 |
| 1 | Paul Beame, Toniann Pitassi, Nathan Segerlind |
Lower bounds for Lovasz-Schrijver systems and beyond follow from multiparty communication complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore |
The resolution complexity of random graph k-colorability. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi, Nathan Segerlind |
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tian Sang, Paul Beame, Henry A. Kautz |
Heuristics for Fast Exact Model Counting. |
SAT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson |
A Direct Sum Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tian Sang, Paul Beame, Henry A. Kautz |
Performing Bayesian Inference by Weighted Model Counting. |
AAAI |
2005 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Joseph C. Culberson, David G. Mitchell, Cristopher Moore |
The Resolution Complexity of Random Graph k-Colorability |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Henry A. Kautz, Ashish Sabharwal |
Towards Understanding and Harnessing the Potential of Clause Learning. |
J. Artif. Intell. Res. (JAIR) |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity yields lower bounds for satisfiability search. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael Molloy |
Exponential bounds for DPLL below the satisfiability threshold. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi |
Combining Component Caching and Clause Learning for Effective Model Counting. |
SAT |
2004 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Time-space trade-off lower bounds for randomized computation of decision problems. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
element distinctness, Branching programs, quadratic forms, random-access machines |
| 1 | Paul Beame, Henry A. Kautz, Ashish Sabharwal |
Understanding the Power of Clause Learning. |
IJCAI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ashish Sabharwal, Paul Beame, Henry A. Kautz |
Using Problem Structure for Efficient Clause Learning. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind |
Memoization and DPLL: Formula Caching Proof Systems. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
Bounded-depth Frege lower bounds for weaker pigeonhole principles |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Faith E. Fich |
Optimal Bounds for the Predecessor Problem and Related Problems. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks |
The Efficiency of Resolution and Davis--Putnam Procedures. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Erik Vee |
Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Erik Vee |
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | William Chan, Richard J. Anderson, Paul Beame, David H. Jones, David Notkin, William E. Warner |
Optimizing Symbolic Model Checking for Statecharts. |
IEEE Trans. Software Eng. |
2001 |
DBLP DOI BibTeX RDF |
TCAS II, partitioned transition relation, automatic abstraction, fault tolerance, Formal verification, binary decision diagrams, statecharts, requirements specifications, symbolic model checking, RSML, avionic systems |
| 1 | Paul Beame, T. S. Jayram, Michael E. Saks |
Time-Space Tradeoffs for Branching Programs. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi |
Propositional Proof Complexity: Past, Present, and Future. |
Current Trends in Theoretical Computer Science |
2001 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Ashish Sabharwal |
Resolution Complexity of Independent Sets in Random Graphs. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas, Paul Beame, Michael S. O. Molloy |
A sharp threshold in proof complexity. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Super-Linear Time-Space Tradeoff Lower Bounds for Randomized Computation |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Super-linear time-space tradeoff lower bounds for randomized computation. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
super-linear time-space tradeoff lower bounds, deterministic RAM algorithms, deterministic Boolean branching programs, computational complexity, lower bound, probability, randomised algorithms, decision problems, branching program, time-space tradeoff, randomized computation |
| 1 | Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa |
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Anderson, Paul Beame, William Chan, David Notkin |
Experiences with the Application of Symbolic Model Checking to the Analysis of Software Specifications. |
Ershov Memorial Conference |
1999 |
DBLP DOI BibTeX RDF |
finite state representations, Formal methods, formal verification, binary decision diagrams, symbolic model checking, software specification |
| 1 | William Chan, Richard J. Anderson, Paul Beame, David H. Jones, David Notkin, William E. Warner |
Decoupling Synchronization from Local Control for Efficient Symbolic Model Checking of Statecharts. |
ICSE |
1999 |
DBLP BibTeX RDF |
fault tolerance, formal methods, formal verification, binary decision diagrams, statecharts, symbolic model checking, software specification |
| 1 | Paul Beame, Faith E. Fich |
Optimal Bounds for the Predecessor Problem. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | William Chan, Richard J. Anderson, Paul Beame, Steve Burns, Francesmary Modugno, David Notkin, Jon Damon Reese |
Model Checking Large Software Specifications. |
IEEE Trans. Software Eng. |
1998 |
DBLP DOI BibTeX RDF |
state-based specifications, Formal methods, requirements, binary decision diagrams, statecharts, software verification, symbolic model checking |
| 1 | Paul Beame, Faith E. Fich |
On Searching Sorted Lists: A Near-Optimal Lower Bound |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Michael E. Saks, Jayram S. Thathachar |
Time-Space Tradeoffs for Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi |
Propositional Proof Complexity: Past, Present and Future |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Toniann Pitassi |
Improved Depth Lower Bounds for Small Distance Connectivity. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
switching lemmas, resource tradeoffs, Circuit complexity, graph connectivity |
| 1 | Paul Beame, Toniann Pitassi |
Propositional Proof Complexity: Past, Present and Future. |
Bulletin of the EATCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
The Relative Complexity of NP Search Problems. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | William Chan, Richard J. Anderson, Paul Beame, David Notkin |
Improving Efficiency of Symbolic Model Checking for State-Based System Requirements. |
ISSTA |
1998 |
DBLP DOI BibTeX RDF |
TCAS II, partitioned transition relation, system requirements specification, formal verification, abstraction, binary decision diagrams, statecharts, reachability analysis, symbolic model checking, RSML |
| 1 | Paul Beame, Michael E. Saks, Jayram S. Thathachar |
Time-Space Tradeoffs for Branching Programs. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
lower bounds, branching programs, time-space tradeoffs |
| 1 | Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks |
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas. |
STOC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Faith E. Fich, Rakesh K. Sinha |
Separating the Power of EREW and CREW PRAMs with Small Communication Width. |
Inf. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | William Chan, Richard J. Anderson, Paul Beame, David Notkin |
Combining Constraint Solving and Symbolic Model Checking for a Class of a Systems with Non-linear Constraints. |
CAV |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Anderson, Paul Beame, Erik Brisson |
Parallel Algorithms for Arrangements. |
Algorithmica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa |
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi |
An Exponential Separation Between the Parity Principle and the Pigeonhole Principle. |
Ann. Pure Appl. Logic |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi |
Simplified and Improved Resolution Lower Bounds. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
resolution lower bounds, randomly generated formulas, random formulas, randomly chosen 3-CNF formula, lower bounds, computability, pigeonhole principle |
| 1 | Richard J. Anderson, Paul Beame, Steve Burns, William Chan, Francesmary Modugno, David Notkin, Jon Damon Reese |
Model Checking Large Software Specifications. |
SIGSOFT FSE |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Toniann Pitassi |
Improved Depth Lower Vounds for Small Distance Connectivity. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
depth lower bounds, small distance connectivity, switching lemma, depth lower bound, computational complexity, graph theory, graph |
| 1 | Paul Beame, Stephen A. Cook, Jeff Edmonds, Russell Impagliazzo, Toniann Pitassi |
The relative complexity of NP search problems. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Miroslaw Kutylowski, Marcin Kik |
Information Broadcasting by Exclusive-Read Prams. |
Parallel Processing Letters |
1994 |
DBLP BibTeX RDF |
|
| 1 | Paul Beame, Martin Tompa, Peiyuan Yan |
Communication-Space Tradeoffs for Unrestricted Protocols. |
SIAM J. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák |
Lower Bound on Hilbert's Nullstellensatz and propositional proofs |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
propositional formulas, Hilbert's Nullstellensatz, propositional proofs, modular counting principle, fixed cardinality, algebraic equations |
| 1 | Toniann Pitassi, Paul Beame, Russell Impagliazzo |
Exponential Lower Bounds for the Pigeonhole Principle. |
Computational Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Faith E. Fich, Rakesh K. Sinha |
Separating the Power of EREW and CREW PRAMs with Small Communication Width. |
WADS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Toniann Pitassi |
An Exponential Separation between the Matching Principle and the Pigeonhole Principle |
LICS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Erik Brisson, Richard E. Ladner |
The Complexity of Computing Symmetric Functions Using Threshold Circuits. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods |
Exponential Lower Bounds for the Pigeonhole Principle |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Joan Lawry |
Randomized versus Nondeterministic Communication Complexity |
STOC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame |
A General Sequential Time-Space Tradeoff for Finding Unique Elements. |
SIAM J. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame |
Lower bounds for recognizing small cliques on CRCW PRAM's. |
Discrete Applied Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Michael Luby |
Parallel Search for Maximal Independence Given Minimal Dependence. |
SODA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Anderson, Paul Beame, Erik Brisson |
Parallel Algorithms for Arrangements. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard J. Anderson, Paul Beame, Walter L. Ruzzo |
Low Overhead Parallel Schedules for Task Graphs. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa |
Time-Space Tradeoffs for Undirected Graph Traversal |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
jumping automata, undirected graph traversal, quadratic lower bound, probabilistic upper bound, time-space tradeoff, deterministic model |
| 1 | Paul Beame, Martin Tompa, Peiyuan Yan |
Communication-Space Tradeoffs for Unrestricted Protocols |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
communicating branching programs, unrestricted protocols, communication-space tradeoffs, hash functions, hashes, matrix-vector products |
| 1 | Paul Beame, Johan Håstad |
Optimal bounds for decision problems on the CRCW PRAM. |
J. ACM |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Hans L. Bodlaender |
Distributed Computing on TRansitive Networks: The Thorus. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame |
A General Sequential Time-Space Tradeoff for Finding Unique Elements |
STOC |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame |
Limits on the Power of Concurrent-Write Parallel Machines |
Inf. Comput. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Johan Håstad |
Optimal Bounds for Decision Problems on the CRCW PRAM |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Beame, Stephen A. Cook, H. James Hoover |
Log Depth Circuits for Division and Related Problems. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")