◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Srivastava

20 papers hereh-index 16820 citations71 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author1
  • middle author7
  • last author12

Across the 20 of 20 papers where every author was matched, so the position is known.

fields
  • cs.DS5
  • cs.DM4
  • cs.CC3
  • math-ph2
  • cs.AI1
  • cs.IT1
same name
  • P. Srivastava — 47 papers, h 15
  • P. Srivastava — 27 papers, h 11
  • P. Srivastava — 11 papers, h 26
  • P. Srivastava — 9 papers, h 11
  • P. Srivastava — 7 papers, h 5
  • P. Srivastava — 5 papers, h 5

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedSpatial mixing and approximation algorithms for graphs with bounded connective constant

37 citations · 121 across the 18 of their papers we have counts for

collaborators
Showing cs.DMShow all

4 papers · 1 filter

cs.DM2022

On complex roots of the independence polynomial

Ferenc Bencs, Péter Csikvári, Piyush Srivastava +1

It is known from the work of Shearer (1985) (and also Scott and Sokal (2005)) that the independence polynomial ZG​(λ) of a graph G of maximum degree at most d+1 does not vani…

cs.DM2017

Online codes for analog signals

Leonard J. Schulman, Piyush Srivastava

This paper revisits a classical scenario in communication theory: a waveform sampled at regular intervals is to be encoded so as to minimize distortion in its reconstruction, despi…

cs.DM2013★ 37 cited

Spatial mixing and approximation algorithms for graphs with bounded connective constant

Alistair Sinclair, Piyush Srivastava, Yitong Yin

The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|)…

cs.DM2011

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

Alistair Sinclair, Piyush Srivastava, Marc Thurley

In a seminal paper (Weitz, 2006), Weitz gave a deterministic fully polynomial approximation scheme for count- ing exponentially weighted independent sets (equivalently, approximati…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.