default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Kiss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c17]Gramoz Goranci, Peter Kiss, Neel Patel, Martin P. Seybold, Eva Szilagyi, Da Wei Zheng:
Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. ICML 2025- [c16]Sepehr Assadi, Sanjeev Khanna, Peter Kiss:
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. SODA 2025: 2971-2990 - [c15]Aaron Bernstein
, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Deterministic Dynamic Maximal Matching in Sublinear Update Time. STOC 2025: 132-143 - [i13]Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Deterministic Dynamic Maximal Matching in Sublinear Update Time. CoRR abs/2504.20780 (2025) - [i12]Gramoz Goranci, Peter Kiss, Neel Patel, Martin P. Seybold, Eva Szilagyi, Da Wei Zheng:
Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time. CoRR abs/2505.09010 (2025) - [i11]Aaron Bernstein, Sayan Bhattacharya, Nick Fischer, Peter Kiss, Thatchaphol Saranurak:
Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems. CoRR abs/2510.20341 (2025) - [i10]Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Qihao Kong, Yi Qian, Eva Szilagyi:
Tree Embedding in High Dimensions: Dynamic and Massively Parallel. CoRR abs/2510.22490 (2025) - [i9]Gramoz Goranci, Shaofeng H.-C. Jiang, Peter Kiss, Eva Szilagyi, Qiaoyuan Yang:
Fully Dynamic Algorithms for Chamfer Distance. CoRR abs/2512.16639 (2025) - 2024
- [j6]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. J. ACM 71(5): 33:1-33:32 (2024) - [c14]Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. STOC 2024: 59-70 - 2023
- [j5]Peter Kiss:
Deterministic Dynamic Matching in Worst-Case Update Time. Algorithmica 85(12): 3741-3765 (2023) - [c13]Joakim Blikstad, Peter Kiss:
Incremental (1-ε)-Approximate Dynamic Matching in O(poly(1/ε)) Update Time. ESA 2023: 22:1-22:19 - [c12]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic (1+ϵ)-Approximate Matching Size in Truly Sublinear Update Time. FOCS 2023: 1563-1588 - [c11]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. SODA 2023: 1-47 - [c10]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. SODA 2023: 100-128 - [c9]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. STOC 2023: 254-266 - [i8]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic $(1+ε)$-Approximate Matching Size in Truly Sublinear Update Time. CoRR abs/2302.05030 (2023) - [i7]Joakim Blikstad, Peter Kiss:
Incremental (1-ε)-approximate dynamic matching in O(poly(1/ε)) update time. CoRR abs/2302.08432 (2023) - [i6]Sayan Bhattacharya, Peter Kiss, Aaron Sidford, David Wajc:
Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs. CoRR abs/2306.11828 (2023) - 2022
- [c8]Peter Kiss:
Deterministic Dynamic Matching in Worst-Case Update Time. ITCS 2022: 94:1-94:21 - [i5]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak, David Wajc:
Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time. CoRR abs/2207.07438 (2022) - [i4]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Dynamic Algorithms for Packing-Covering LPs via Multiplicative Weight Updates. CoRR abs/2207.07519 (2022) - [i3]Sayan Bhattacharya, Peter Kiss, Thatchaphol Saranurak:
Sublinear Algorithms for (1.5+ε)-Approximate Matching. CoRR abs/2212.00189 (2022) - 2021
- [c7]Sayan Bhattacharya, Peter Kiss:
Deterministic Rounding of Dynamic Fractional Matchings. ICALP 2021: 27:1-27:14 - [i2]Sayan Bhattacharya, Peter Kiss:
Deterministic Rounding of Dynamic Fractional Matchings. CoRR abs/2105.01615 (2021) - [i1]Peter Kiss:
Improving update times of dynamic matching algorithms from amortized to worst case. CoRR abs/2108.10461 (2021)
2000 – 2009
- 2006
- [j4]Jesús Arias Álvarez, Peter Kiss, Vladimir I. Prodanov, Vito Boccuzzi, Mihai Banu, David Bisbal, Jacinto San Pablo, Luis Quintanilla, Juan Barbolla:
A 32-mW 320-MHz continuous-time complex delta-sigma ADC for multi-mode wireless-LAN receivers. IEEE J. Solid State Circuits 41(2): 339-351 (2006) - 2005
- [j3]Jesús Arias Álvarez, Peter Kiss, Vito Boccuzzi, Luis Quintanilla, Lourdes Enríquez, José Vicente, David Bisbal, Jacinto San Pablo, Juan Barbolla:
Nonlinearity correction for multibit ΔΣ DACs. IEEE Trans. Circuits Syst. I Regul. Pap. 52-I(6): 1033-1041 (2005) - 2004
- [j2]Peter Kiss, Jesús Arias Álvarez, Dandan Li, Vito Boccuzzi:
Stable high-order delta-sigma digital-to-analog converters. IEEE Trans. Circuits Syst. I Regul. Pap. 51-I(1): 200-205 (2004) - [j1]Peter Kiss, Vladimir I. Prodanov:
One-tap wideband I/Q compensation for zero-IF filters. IEEE Trans. Circuits Syst. I Regul. Pap. 51-I(6): 1062-1074 (2004) - [c6]Peter Kiss, Vladimir I. Prodanov:
I/Q imbalance of two-path ladder filters. ISCAS (1) 2004: 1004-1007 - 2003
- [c5]Peter Kiss, Jesús Arias Álvarez, Dandan Li:
Stable high-order delta-sigma DACS. ISCAS (1) 2003: 985-988 - 2002
- [c4]José Silva, Xuesheng Wang, Peter Kiss, Un-Ku Moon, Gabor C. Temes:
Digital techniques for improved ΔΣ data conversion. CICC 2002: 183-190 - [c3]Peter Kiss, Vladimir I. Prodanov, Jack P. F. Glas:
Complex low-pass filters. ISCAS (1) 2002: 525-528 - 2001
- [c2]Peter Kiss, Un-Ku Moon, Jesper Steensgaard, John T. Stonick, Gabor C. Temes:
Multibit Sigma-Delta ADC with mixed-mode DAC error correction. ISCAS (1) 2001: 280-283 - 2000
- [c1]Peter Kiss, José Silva, Un-Ku Moon, John T. Stonick, Gabor C. Temes:
Improved adaptive digital compensation for cascaded ΔΣ ADCs. ISCAS 2000: 33-36
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-05 23:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
