Improved adaptive digital compensation for cascaded ΔΣ ADCs. - Peter Kiss; José Silva 002; Un-Ku Moon; John T. Stonick; Gabor C. Temes (ISCAS, 2000)

Multibit Sigma-Delta ADC with mixed-mode DAC error correction. - Peter Kiss; Un-Ku Moon; Jesper Steensgaard; John T. Stonick; Gabor C. Temes (ISCAS (1), 2001)

Digital techniques for improved ΔΣ data conversion. - José Silva 002; Xuesheng Wang; Peter Kiss; Un-Ku Moon; Gabor C. Temes (CICC, 2002)

Complex low-pass filters. - Peter Kiss; Vladimir I. Prodanov; Jack P. F. Glas (ISCAS (1), 2002)

Stable high-order delta-sigma DACS. - Peter Kiss; Jesús Arias Álvarez; Dandan Li (ISCAS (1), 2003)

I/Q imbalance of two-path ladder filters. - Peter Kiss; Vladimir I. Prodanov (ISCAS (1), 2004)

Stable high-order delta-sigma digital-to-analog converters. - Peter Kiss; Jesús Arias Álvarez; Dandan Li; Vito Boccuzzi (IEEE Trans. Circuits Syst. I Regul. Pap., 2004)

One-tap wideband I/Q compensation for zero-IF filters. - Peter Kiss; Vladimir I. Prodanov (IEEE Trans. Circuits Syst. I Regul. Pap., 2004)

Nonlinearity correction for multibit ΔΣ DACs. - Jesús Arias Álvarez; Peter Kiss; Vito Boccuzzi; Luis Quintanilla; Lourdes Enríquez; José Vicente; David Bisbal; Jacinto San Pablo; Juan Barbolla (IEEE Trans. Circuits Syst. I Regul. Pap., 2005)

A 32-mW 320-MHz continuous-time complex delta-sigma ADC for multi-mode wireless-LAN receivers. - Jesús Arias Álvarez; Peter Kiss; Vladimir I. Prodanov; Vito Boccuzzi; Mihai Banu; David Bisbal; Jacinto San Pablo; Luis Quintanilla; Juan Barbolla (IEEE J. Solid State Circuits, 2006)

Deterministic Rounding of Dynamic Fractional Matchings. - Sayan Bhattacharya; Peter Kiss (ICALP, 2021)

Improving update times of dynamic matching algorithms from amortized to worst case. - Peter Kiss (CoRR, 2021)

Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time. - Joakim Blikstad; Peter Kiss (ESA, 2023)

Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (FOCS, 2023)

Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (SODA, 2023)

Sublinear Algorithms for (1.5+ε)-Approximate Matching. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (STOC, 2023)

Deterministic Dynamic Matching in Worst-Case Update Time. - Peter Kiss (Algorithmica, 2023)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. - Sayan Bhattacharya; Peter Kiss; Aaron Sidford; David Wajc (STOC, 2024)

Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. - Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak; David Wajc (J. ACM, 2024)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. - Sepehr Assadi; Sanjeev Khanna; Peter Kiss (SODA, 2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time. - Aaron Bernstein; Sayan Bhattacharya; Peter Kiss; Thatchaphol Saranurak (STOC, 2025)

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. - Gramoz Goranci; Peter Kiss; Neel Patel; Martin P. Seybold; Eva Szilagyi; Da Wei Zheng (CoRR, 2025)