Travelled to:1 × Australia
1 × Greece
1 × Israel
1 × Italy
1 × Japan
1 × Poland
1 × Portugal
1 × United Kingdom
14 × USA
3 × Canada
Collaborated with:T.Pitassi ∅ D.Suciu H.A.Kautz V.Liew W.Chan R.J.Anderson D.Notkin R.Impagliazzo P.Koutris T.Sang E.Vee F.E.Fich J.Lawry J.Håstad M.Patrascu C.Beck T.Huynh T.S.Jayram A.Rudra N.Segerlind A.Sabharwal D.Achlioptas M.S.O.Molloy G.V.d.Broeck E.Gribkoff M.David P.Woelfel R.M.Karp M.E.Saks F.Bacchus S.A.Cook J.Edmonds D.H.Jones W.E.Warner J.Krajícek P.Pudlák A.R.Woods S.Burns F.Modugno J.D.Reese
Talks about:complex (8) model (7) bound (7) communic (5) problem (5) space (5) lower (4) check (4) multiparti (3) tradeoff (3)
Person: Paul Beame
DBLP: Beame:Paul
Contributed to:
2015
201520142013
20122010200720072005
20052004200320022001
19991999
19981998
1997
1996199519921989198719862017Wrote 27 papers:
- ICALP-v1-2015-BeameLP #bound
- Finding the Median (Obliviously) with Bounded Space (PB, VL, MP), pp. 103–115.
- PODS-2015-BeameBGS #first-order #symmetry
- Symmetric Weighted First-Order Model Counting (PB, GVdB, EG, DS), pp. 313–328.
- PODS-2014-BeameKS #parallel #query
- Skew in parallel query processing (PB, PK, DS), pp. 212–223.
- PODS-2013-BeameKS #communication #parallel #query
- Communication steps for parallel query processing (PB, PK, DS), pp. 273–284.
- STOC-2012-BeameBI #bound #trade-off
- Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space (PB, CB, RI), pp. 213–232.
- STOC-2010-BeameHP #complexity #proving
- Hardness amplification in proof complexity (PB, TH, TP), pp. 87–96.
- ICALP-2007-BeameDPW #communication #complexity #multi #nondeterminism
- Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity (PB, MD, TP, PW), pp. 134–145.
- STOC-2007-BeameJR #algorithm #bound #random
- Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.
- ICALP-2005-BeamePS #bound #communication #complexity #multi
- Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (PB, TP, NS), pp. 1176–1188.
- SAT-2005-SangBK #heuristic #performance
- Heuristics for Fast Exact Model Counting (TS, PB, HAK), pp. 226–240.
- SAT-2004-SangBBKP #component #effectiveness #learning
- Combining Component Caching and Clause Learning for Effective Model Counting (TS, FB, PB, HAK, TP), pp. 20–28.
- SAT-2003-SabharwalBK #learning #performance #problem #using
- Using Problem Structure for Efficient Clause Learning (AS, PB, HAK), pp. 242–256.
- STOC-2002-BeameV #communication #complexity #multi #nearest neighbour #problem #trade-off
- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems (PB, EV), pp. 688–697.
- STOC-2001-AchlioptasBM #complexity #proving
- A sharp threshold in proof complexity (DA, PB, MSOM), pp. 337–346.
- ICSE-1999-ChanABJNW #model checking #performance
- Decoupling Synchronization from Local Control for Efficient Symbolic Model Checking of Statecharts (WC, RJA, PB, DHJ, DN, WEW), pp. 142–151.
- STOC-1999-BeameF #bound #problem
- Optimal Bounds for the Predecessor Problem (PB, FEF), pp. 295–304.
- ISSTA-1998-ChanABN #model checking #performance #requirements
- Improving Efficiency of Symbolic Model Checking for State-Based System Requirements (WC, RJA, PB, DN), pp. 102–112.
- STOC-1998-BeameKPS #complexity #on the #proving #random #satisfiability
- On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
- CAV-1997-ChanABN #constraints #model checking #theorem proving
- Combining Constraint Solving and Symbolic Model Checking for a Class of a Systems with Non-linear Constraints (WC, RJA, PB, DN), pp. 316–327.
- FSE-1996-AndersonBBCMNR #model checking #scalability #specification
- Model Checking Large Software Specifications (RJA, PB, SB, WC, FM, DN, JDR), pp. 156–166.
- STOC-1995-BeameCEIP #complexity #problem
- The relative complexity of NP search problems (PB, SAC, JE, RI, TP), pp. 303–314.
- STOC-1992-BeameIKPPW #bound #exponential #principle
- Exponential Lower Bounds for the Pigeonhole Principle (PB, RI, JK, TP, PP, ARW), pp. 200–220.
- STOC-1992-BeameL #communication #complexity #nondeterminism #random
- Randomized versus Nondeterministic Communication Complexity (PB, JL), pp. 188–199.
- STOC-1989-Beame #trade-off
- A General Sequential Time-Space Tradeoff for Finding Unique Elements (PB), pp. 197–203.
- STOC-1987-BeameH #bound #problem
- Optimal Bounds for Decision Problems on the CRCW PRAM (PB, JH), pp. 83–93.
- STOC-1986-Beame #parallel #power of
- Limits on the Power of Concurrent-Write Parallel Machines (PB), pp. 169–176.
- CAV-2017-BeameL #integer #towards #verification
- Towards Verifying Nonlinear Integer Arithmetic (PB, VL), pp. 238–258.