default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFelix Poloczek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c12]Florin Ciucu, Felix Poloczek, Lydia Y. Chen, Martin Chan:
Practical Analysis of Replication-Based Systems. INFOCOM 2021: 1-10
2010 – 2019
- 2019
- [j5]Florin Ciucu, Felix Poloczek, Amr Rizk:
Queue and Loss Distributions in Finite-Buffer Queues. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 31:1-31:29 (2019) - [c11]Florin Ciucu, Felix Poloczek:
Two Extensions of Kingman's GI/G/1 Bound. SIGMETRICS (Abstracts) 2019: 63-64 - [c10]Florin Ciucu, Felix Poloczek, Amr Rizk:
Queue and Loss Distributions in Finite-Buffer Queues. SIGMETRICS (Abstracts) 2019: 65-66 - 2018
- [j4]Florin Ciucu, Felix Poloczek:
Two Extensions of Kingman's GI/G/1 Bound. Proc. ACM Meas. Anal. Comput. Syst. 2(3): 43:1-43:33 (2018) - 2016
- [j3]Amr Rizk, Felix Poloczek, Florin Ciucu:
Stochastic bounds in Fork-Join queueing systems under full and partial mapping. Queueing Syst. Theory Appl. 83(3-4): 261-291 (2016) - [c9]Felix Poloczek, Florin Ciucu:
Contrasting Effects of Replication in Parallel Systems: From Overload to Underload and Back. SIGMETRICS 2016: 375-376 - [c8]Florin Ciucu, Felix Poloczek, Jens B. Schmitt:
Stochastic Upper and Lower Bounds for General Markov Fluids. ITC 2016: 184-192 - [i2]Felix Poloczek, Florin Ciucu:
Contrasting Effects of Replication in Parallel Systems: From Overload to Underload and Back. CoRR abs/1602.07978 (2016) - 2015
- [c7]Felix Poloczek, Florin Ciucu:
Service-martingales: Theory and applications to the delay analysis of random access protocols. INFOCOM 2015: 945-953 - [c6]Florin Ciucu, Felix Poloczek:
On multiplexing flows: Does it hurt or not? INFOCOM 2015: 1122-1130 - [c5]Amr Rizk, Felix Poloczek, Florin Ciucu:
Computable Bounds in Fork-Join Queueing Systems. SIGMETRICS 2015: 335-346 - 2014
- [j2]Felix Poloczek, Florin Ciucu:
Scheduling analysis with martingales. Perform. Evaluation 79: 56-72 (2014) - [c4]Florin Ciucu, Felix Poloczek, Jens B. Schmitt:
Sharp per-flow delay bounds for bursty arrivals: The case of FIFO, SP, and EDF scheduling. INFOCOM 2014: 1896-1904 - [c3]Florin Ciucu, Felix Poloczek, Oliver Hohlfeld
:
On capacity dimensioning in dynamic scenarios: The key role of peak values. LANMAN 2014: 1-6 - 2013
- [j1]Felix Poloczek, Florin Ciucu:
A martingale-envelope and applications. SIGMETRICS Perform. Evaluation Rev. 41(3): 43-45 (2013) - [c2]Florin Ciucu, Felix Poloczek, Jens B. Schmitt:
Sharp bounds in stochastic network calculus. SIGMETRICS 2013: 367-368 - [i1]Florin Ciucu, Felix Poloczek, Jens B. Schmitt:
Sharp Bounds in Stochastic Network Calculus. CoRR abs/1303.4114 (2013) - 2012
- [c1]Felix Poloczek, Florin Ciucu:
Coding of Brownian motion by quantization of exit times. Allerton Conference 2012: 557-564
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 2024-04-24 23:10 CEST 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:
