Peter Kiss

40 papers A* 12A 2C 1Journal 20Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Dynamic Hierarchical
CoRR
Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zöcklein
2026 A* conf
Dynamic Hierarchical j-Tree Decomposition and Its Applications.
SODA
Gramoz Goranci, Monika Henzinger, Peter Kiss, Ali Momeni, Gernot Zöcklein
2026 A* conf
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems.
SODA
Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak
2026 A* conf
Tree Embedding in High Dimensions: Dynamic and Massively Parallel.
SODA
Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian, Eva Szilagyi
2025 A* conf
Deterministic Dynamic Maximal Matching in Sublinear Update Time.
STOC
Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2025 J jnl
Deterministic Dynamic Maximal Matching in Sublinear Update Time.
CoRR
Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2025 J jnl
Fully Dynamic Algorithms for Chamfer Distance.
CoRR
Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Eva Szilagyi, Qiaoyuan Yang
2025 A* conf
Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time.
ICML
Gramoz Goranci, Peter Kiss, Neel Patel, Martin P. Seybold, Eva Szilagyi, Da Wei Zheng
2025 J jnl
Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time.
CoRR
Gramoz Goranci, Peter Kiss, Neel Patel, Martin P. Seybold, Eva Szilagyi, Da Wei Zheng
2025 A* conf
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs.
SODA
Sepehr Assadi, Sanjeev Khanna, Peter Kiss
2025 J jnl
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems.
CoRR
Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak
2025 J jnl
Tree Embedding in High Dimensions: Dynamic and Massively Parallel.
CoRR
Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian, Eva Szilagyi
2024 J jnl
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.
J. ACM
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
2024 A* conf
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs.
STOC
Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc
2023 J jnl
Deterministic Dynamic Matching in Worst-Case Update Time.
Algorithmica
Peter Kiss
2023 J jnl
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time.
FOCS
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates.
SODA
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2023 A* conf
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.
SODA
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
2023 A conf
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time.
ESA
Joakim Blikstad, Peter Kiss
2023 J jnl
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time.
CoRR
Joakim Blikstad, Peter Kiss
2023 J jnl
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs.
CoRR
Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc
2023 A* conf
Sublinear Algorithms for (1.5+ε)-Approximate Matching.
STOC
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2022 A conf
Deterministic Dynamic Matching in Worst-Case Update Time.
ITCS
Peter Kiss
2022 J jnl
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2022 J jnl
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc
2022 J jnl
Sublinear Algorithms for (1.5+ε)-Approximate Matching.
CoRR
Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak
2021 A* conf
Deterministic Rounding of Dynamic Fractional Matchings.
ICALP
Sayan Bhattacharya, Peter Kiss
2021 J jnl
Deterministic Rounding of Dynamic Fractional Matchings.
CoRR
Sayan Bhattacharya, Peter Kiss
2021 J jnl
Improving update times of dynamic matching algorithms from amortized to worst case.
CoRR
Peter Kiss
2006 J jnl
A 32-mW 320-MHz continuous-time complex delta-sigma ADC for multi-mode wireless-LAN receivers.
IEEE J. Solid State Circuits
Jesús Arias Álvarez, Peter Kiss, Vladimir I. Prodanov, Vito Boccuzzi, Mihai Banu, David Bisbal, Jacinto San Pablo, Luis Quintanilla, Juan Barbolla
2005 J jnl
Nonlinearity correction for multibit ΔΣ DACs.
IEEE Trans. Circuits Syst. I Regul. Pap.
Jesús Arias Álvarez, Peter Kiss, Vito Boccuzzi, Luis Quintanilla, Lourdes Enríquez, José Vicente, David Bisbal, Jacinto San Pablo, Juan Barbolla
2004 — conf
I/Q imbalance of two-path ladder filters.
ISCAS (1)
Peter Kiss, Vladimir I. Prodanov
2004 J jnl
One-tap wideband I/Q compensation for zero-IF filters.
IEEE Trans. Circuits Syst. I Regul. Pap.
Peter Kiss, Vladimir I. Prodanov
2004 J jnl
Stable high-order delta-sigma digital-to-analog converters.
IEEE Trans. Circuits Syst. I Regul. Pap.
Peter Kiss, Jesús Arias Álvarez, Dandan Li, Vito Boccuzzi
2003 — conf
Stable high-order delta-sigma DACS.
ISCAS (1)
Peter Kiss, Jesús Arias Álvarez, Dandan Li
2002 — conf
Complex low-pass filters.
ISCAS (1)
Peter Kiss, Vladimir I. Prodanov, Jack P. F. Glas
2002 — conf
Digital techniques for improved ΔΣ data conversion.
CICC
José Silva, Xuesheng Wang, Peter Kiss, Un-Ku Moon, Gabor C. Temes
2001 — conf
Multibit Sigma-Delta ADC with mixed-mode DAC error correction.
ISCAS (1)
Peter Kiss, Un-Ku Moon, Jesper Steensgaard, John T. Stonick, Gabor C. Temes
2000 C conf
Improved adaptive digital compensation for cascaded ΔΣ ADCs.
ISCAS
Peter Kiss, José Silva, Un-Ku Moon, John T. Stonick, Gabor C. Temes