<?xml version="1.0" encoding="utf-8" standalone="yes"?>&lt;?xml-stylesheet type="text/xsl" href="https://academic-works.astrareconslabs.com/feed.xsl"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Parth Sinha</title><link>https://academic-works.astrareconslabs.com/</link><description>Academic homepage of Parth Sinha, researcher in Computer Science.</description><language>en-gb</language><managingEditor> (Parth Sinha)</managingEditor><lastBuildDate>Sat, 16 May 2026 10:34:04 +0000</lastBuildDate><atom:link href="https://academic-works.astrareconslabs.com/index.xml" rel="self" type="application/rss+xml"/><item><title>The FABRIC Strategy for Verifying Neural Feedback Systems</title><link>https://academic-works.astrareconslabs.com/notes/~/the-fabric-strategy-for-verifying-neural-feedback-systems/</link><pubDate>Sat, 16 May 2026 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/notes/~/the-fabric-strategy-for-verifying-neural-feedback-systems/</guid><description>Notes on the FABRIC strategy for verifying nonlinear neural feedback systems by combining forward reachability, backward reachability, polyhedral enclosures, MILP encodings, DRiPy refinement, and FITS inner-set construction.</description></item><item><title>Reachable Polyhedral Marching for Deep-Learned Control Systems</title><link>https://academic-works.astrareconslabs.com/notes/~/reachable-polyhedral-marching-for-deep-learned-control-systems/</link><pubDate>Wed, 13 May 2026 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/notes/~/reachable-polyhedral-marching-for-deep-learned-control-systems/</guid><description>Notes on Vincent &amp;amp; Schwager (2022) introducing the Reachable Polyhedral Marching (RPM) algorithm for exact reachability analysis of ReLU neural network controllers.</description></item><item><title>Demo Note: Images, Tables, and LaTeX in Academic Work</title><link>https://academic-works.astrareconslabs.com/notes/~/demo-note-images-tables-and-latex-in-academic-work/</link><pubDate>Sun, 12 Jan 2025 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/notes/~/demo-note-images-tables-and-latex-in-academic-work/</guid><description>A showcase note demonstrating image embedding, a borderless striped table, lists, code, and LaTeX rendering in the Academic Work theme.</description></item><item><title>Curriculum Vitae</title><link>https://academic-works.astrareconslabs.com/library/~/curriculum-vitae/</link><pubDate>Fri, 01 Nov 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/library/~/curriculum-vitae/</guid><description>Full academic CV including education, publications, talks, awards, and service.</description></item><item><title>Reading Notes: Lamport Clocks and Happens-Before</title><link>https://academic-works.astrareconslabs.com/notes/~/reading-notes-lamport-clocks-and-happens-before/</link><pubDate>Thu, 03 Oct 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/notes/~/reading-notes-lamport-clocks-and-happens-before/</guid><description>Notes on Lamport&amp;rsquo;s 1978 paper introducing logical clocks and the happens-before relation, with observations on how the idea maps onto modern distributed databases.</description></item><item><title>Adaptive Consensus Protocols Under Partial Synchrony</title><link>https://academic-works.astrareconslabs.com/research/~/adaptive-consensus-protocols-under-partial-synchrony/</link><pubDate>Sun, 15 Sep 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/research/~/adaptive-consensus-protocols-under-partial-synchrony/</guid><description>We present AdaptRaft, a variant of the Raft consensus algorithm that dynamically adjusts its timing parameters using a lightweight online learning model, reducing tail latency by up to 34% in geo-distributed deployments.</description></item><item><title>AdaptRaft</title><link>https://academic-works.astrareconslabs.com/projects/~/adaptraft/</link><pubDate>Thu, 01 Aug 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/projects/~/adaptraft/</guid><description>A modified Raft implementation with an online bandit learner that adapts election and heartbeat timeouts to observed network conditions. Companion codebase for the SOSP 2024 paper.</description></item><item><title>Working Notes: What Raft Actually Guarantees</title><link>https://academic-works.astrareconslabs.com/notes/~/working-notes-what-raft-actually-guarantees/</link><pubDate>Thu, 18 Jul 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/notes/~/working-notes-what-raft-actually-guarantees/</guid><description>Informal notes clarifying which safety and liveness properties Raft provides under which assumptions, written while preparing a talk on adaptive consensus.</description></item><item><title>Byzantine Fault Tolerance in Practice: A Survey of Modern BFT Protocols</title><link>https://academic-works.astrareconslabs.com/research/~/byzantine-fault-tolerance-in-practice-a-survey-of-modern-bft-protocols/</link><pubDate>Fri, 01 Mar 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/research/~/byzantine-fault-tolerance-in-practice-a-survey-of-modern-bft-protocols/</guid><description>A structured survey of Byzantine fault-tolerant consensus protocols deployed since 2015, identifying the practical trade-offs between safety, liveness, and throughput that are often obscured in theoretical treatments.</description></item><item><title>Distributed Systems — Hilary Term 2024</title><link>https://academic-works.astrareconslabs.com/teaching/~/distributed-systems-hilary-term-2024/</link><pubDate>Mon, 15 Jan 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/teaching/~/distributed-systems-hilary-term-2024/</guid><description>Graduate teaching assistant for the Distributed Systems course. Eight tutorials covering consensus, replication, fault tolerance, and consistency models.</description></item><item><title>Distributed Systems Reading List</title><link>https://academic-works.astrareconslabs.com/library/~/distributed-systems-reading-list/</link><pubDate>Mon, 15 Jan 2024 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/library/~/distributed-systems-reading-list/</guid><description>A curated reading list for anyone starting research in distributed systems — foundational papers, key textbooks, and a handful of essential blog posts.</description></item><item><title>DistBench</title><link>https://academic-works.astrareconslabs.com/projects/~/distbench/</link><pubDate>Wed, 01 Nov 2023 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/projects/~/distbench/</guid><description>A configurable benchmarking harness for distributed consensus protocols. Supports pluggable protocol implementations, synthetic and replay workloads, and structured JSON output for reproducible experiments.</description></item><item><title>Algorithms — Michaelmas Term 2023</title><link>https://academic-works.astrareconslabs.com/teaching/~/algorithms-michaelmas-term-2023/</link><pubDate>Sun, 01 Oct 2023 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/teaching/~/algorithms-michaelmas-term-2023/</guid><description>Undergraduate tutor for the first-year Algorithms course. Six tutorials covering sorting, graph algorithms, dynamic programming, and complexity.</description></item><item><title>First Year of a PhD: What I Wish I Had Known</title><link>https://academic-works.astrareconslabs.com/notes/~/first-year-of-a-phd-what-i-wish-i-had-known/</link><pubDate>Fri, 01 Sep 2023 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/notes/~/first-year-of-a-phd-what-i-wish-i-had-known/</guid><description>Honest notes on what the first year of doctoral research actually looks like — the good, the disorienting, and the practical.</description></item><item><title>Learned Indices for Distributed Key-Value Stores</title><link>https://academic-works.astrareconslabs.com/research/~/learned-indices-for-distributed-key-value-stores/</link><pubDate>Sat, 10 Jun 2023 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/research/~/learned-indices-for-distributed-key-value-stores/</guid><description>We explore the applicability of learned index structures to distributed key-value stores, demonstrating that model-based indices can reduce lookup latency by 22% with a modest increase in memory footprint on skewed workloads.</description></item><item><title>MEng Thesis: A Comparative Analysis of Byzantine Fault-Tolerant Consensus Protocols</title><link>https://academic-works.astrareconslabs.com/library/~/meng-thesis-a-comparative-analysis-of-byzantine-fault-tolerant-consensus-protocols/</link><pubDate>Wed, 01 Jun 2022 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/library/~/meng-thesis-a-comparative-analysis-of-byzantine-fault-tolerant-consensus-protocols/</guid><description>My undergraduate thesis comparing PBFT, HotStuff, and Tendermint across latency, throughput, and message complexity in a simulated WAN environment.</description></item><item><title>Theme</title><link>https://academic-works.astrareconslabs.com/theme/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://academic-works.astrareconslabs.com/theme/</guid><description>A single-page reference for the Academic Work theme system: palette, spacing, grids, prose, tables, code, and LaTeX.</description></item></channel></rss>