Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Perfect matchings in o(n log n) time in regular bipartite ..."

Ashish Goel, Michael Kapralov, Sanjeev Khanna (2010)

> Home

Details and statistics

DOI: 10.1145/1806689.1806697

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/GoelKK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/GoelKK10
Ashish Goel, Michael Kapralov, Sanjeev Khanna:
Perfect matchings in o(n log n) time in regular bipartite graphs. STOC 2010: 39-46

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.