Matthew W. Moskewicz

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Conor F. Madigan

> Home > Persons > Matthew W. Moskewicz

Publications

2001
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/dac/MoskewiczMZZM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dac/MoskewiczMZZM01
Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, Sharad Malik:
Chaff: Engineering an Efficient SAT Solver. DAC 2001: 530-535
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iccad/ZhangMMM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/ZhangMMM01
Lintao Zhang, Conor F. Madigan, Matthew W. Moskewicz, Sharad Malik:
Efficient Conflict Driven Learning in Boolean Satisfiability Solver. ICCAD 2001: 279-285
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/iccd/ZhaoMWMM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccd/ZhaoMWMM01
Ying Zhao, Sharad Malik, Albert R. Wang, Matthew W. Moskewicz, Conor F. Madigan:
Matching Architecture to Application Via Configurable Processors: A Case Study with Boolean Satisfiability Problem. ICCD 2001: 447-452
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/isss/ZhaoMMM01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isss/ZhaoMMM01
Ying Zhao, Sharad Malik, Matthew W. Moskewicz, Conor F. Madigan:
Accelerating boolean satisfiability through application specific processing. ISSS 2001: 244-249

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.