◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

R. Mittal

23 papers hereh-index 7322.3k citations498 works total

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

author position
  • first author2
  • middle author9
  • last author12

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

fields
  • physics.flu-dyn11
  • quant-ph5
  • cs.CC4
  • math.NT2
  • cs.SC1
same name
  • R. Mittal — 69 papers, h 30
  • R. Mittal — 25 papers, h 11
  • R. Mittal — 22 papers, h 16
  • R. Mittal — 10 papers, h 14
  • R. Mittal — 2 papers, h 1
  • R. Mittal — 2 papers, h 2

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
20082023
most citedThe Flow Physics of COVID-19

516 citations · 1.1k across the 20 of their papers we have counts for

collaborators
Showing 2019Show all

4 papers · 1 filter

physics.flu-dyn2019★ 50 cited

Dynamic mode decomposition based analysis of flow over a sinusoidally pitching airfoil

Karthik Menon, Rajat Mittal

Dynamic mode decomposition (DMD) has proven to be a valuable tool for the analysis of complex flow-fields but the application of this technique to flows with moving boundaries is n…

physics.flu-dyn2019★ 63 cited

Spatio-temporal dynamics of turbulent separation bubbles

Wen Wu, Charles Meneveau, Rajat Mittal

The spatio-temporal dynamics of separation bubbles induced to form in a fully-developed turbulent boundary layer (with Reynolds number based on momentum thickness of the boundary l…

cs.SC2019★ 2 cited

Counting basic-irreducible factors mod pk in deterministic poly-time and p-adic applications

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

Finding an irreducible factor, of a polynomial f(x) modulo a prime p, is not known to be in deterministic polynomial time. Though there is such a classical algorithm that {\em…

cs.CC2019

Efficiently factoring polynomials modulo p4

Ashish Dwivedi, Rajat Mittal, Nitin Saxena

Polynomial factoring has famous practical algorithms over fields-- finite, rational \& p-adic. However, modulo prime powers it gets hard as there is non-unique factorization and…

◍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.