default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksi Penttinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j11]Esa Hyytiä
, Aleksi Penttinen, Reijo Sulonen:
Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives. Comput. Oper. Res. 39(12): 3021-3030 (2012)- [j10]Esa Hyytiä, Aleksi Penttinen, Samuli Aalto:
Size- and state-aware dispatching problem with queue-specific job sizes. Eur. J. Oper. Res. 217(2): 357-370 (2012) - [j9]Esa Hyytiä, Samuli Aalto, Aleksi Penttinen, Jorma T. Virtamo:
On the Value Function of the M/G/1 FCFS and LCFS Queues. J. Appl. Probab. 49(4): 1052-1071 (2012) - [j8]Samuli Aalto, Aleksi Penttinen, Pasi E. Lassila, Prajwal Osti:
Optimal size-based opportunistic scheduler for wireless systems. Queueing Syst. Theory Appl. 72(1-2): 5-30 (2012) - [c19]Pasi E. Lassila, Aleksi Penttinen, Samuli Aalto:
Flow-level modeling and analysis of dynamic TDD in LTE. NGI 2012: 33-40 - [c18]Esa Hyytiä, Samuli Aalto, Aleksi Penttinen:
Minimizing slowdown in heterogeneous size-aware dispatching systems. SIGMETRICS 2012: 29-40 - [i1]Esa Hyytiä, Samuli Aalto, Aleksi Penttinen:
Minimizing Slowdown in Heterogeneous Size-Aware Dispatching Systems (full version). CoRR abs/1203.5040 (2012) - 2011
- [j7]Esa Hyytiä, Jorma T. Virtamo, Samuli Aalto, Aleksi Penttinen:
M/M/1-PS queue and size-aware task assignment. Perform. Evaluation 68(11): 1136-1148 (2011) - [c17]Aleksi Penttinen, Esa Hyytiä, Samuli Aalto:
Energy-aware dispatching in parallel queues with on-off energy consumption. IPCCC 2011: 1-8 - [c16]Samuli Aalto, Aleksi Penttinen, Pasi E. Lassila, Prajwal Osti:
On the optimal trade-off between SRPT and opportunistic scheduling. SIGMETRICS 2011: 185-196 - [c15]Esa Hyytiä, Aleksi Penttinen, Samuli Aalto, Jorma T. Virtamo:
Dispatching problem with fixed size jobs and processor sharing discipline. ITC 2011: 190-197 - 2010
- [j6]Esa Hyytiä, Samuli Aalto, Aleksi Penttinen, Reijo Sulonen:
A stochastic model for a vehicle in a dial-a-ride system. Oper. Res. Lett. 38(5): 432-435 (2010) - [c14]Esa Hyytiä, Aleksi Penttinen, Reijo Sulonen:
Congestive Collapse and Its Avoidance in a Dynamic Dial-a-Ride System with Time Windows. ASMTA 2010: 397-408 - [c13]Esa Hyytiä, Lauri Häme, Aleksi Penttinen, Reijo Sulonen:
Simulation of a large scale dynamic pickup and delivery problem. SimuTools 2010: 77
2000 – 2009
- 2009
- [j5]Pasi E. Lassila, Aleksi Penttinen, Jorma T. Virtamo:
Communication Networks Dimensioning of data networks: a flow-level perspective. Eur. Trans. Telecommun. 20(6): 549-563 (2009) - [j4]Juha Leino, Aleksi Penttinen, Jorma T. Virtamo:
Flow-optimized random access for wireless multihop networks. Perform. Evaluation 66(3-5): 258-271 (2009) - 2008
- [j3]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. Ad Hoc Sens. Wirel. Networks 6(3-4): 239-263 (2008) - [j2]Aleksi Penttinen:
Computation of Fair Flow Rates in Data Networks. IEEE Commun. Lett. 12(1): 53-55 (2008) - 2007
- [c12]Petteri Kaski, Aleksi Penttinen, Jukka Suomela:
Coordinating Concurrent Transmissions: A Constant-Factor Approximation of Maximum-Weight Independent Set in Local Conflict Graphs. ADHOC-NOW 2007: 74-86 - [c11]Pasi E. Lassila, Aleksi Penttinen, Jorma T. Virtamo:
Dimensioning methods for data networks with flow-level QoS requirements. LCN 2007: 353-359 - [c10]Juha Leino, Aleksi Penttinen, Jorma T. Virtamo:
Flow-optimized random access for wireless multihop networks. MSWiM 2007: 387-394 - [c9]Juha Leino, Aleksi Penttinen, Jorma T. Virtamo:
Approximating Flow Throughput in Complex Data Networks. ITC 2007: 422-433 - 2006
- [j1]Aleksi Penttinen, Jorma T. Virtamo, Riku Jäntti:
Performance analysis in multi-hop radio networks with balanced fair resource sharing. Telecommun. Syst. 31(4): 315-336 (2006) - [c8]Juha Leino, Aleksi Penttinen, Jorma T. Virtamo:
Flow Level Performance Analysis of Wireless Data Networks: A Case Study. ICC 2006: 961-966 - [c7]Aleksi Penttinen:
Minimum cost multicast trees in ad hoc networks. ICC 2006: 3676-3681 - [c6]Pasi E. Lassila, Aleksi Penttinen, Jorma T. Virtamo:
Dimensioning of wireless mesh networks with flow-level QoS requirements. PE-WASUN 2006: 17-24 - [c5]Thomas Bonald, Aleksi Penttinen, Jorma T. Virtamo:
On light and heavy traffic approximations of balanced fairness. SIGMETRICS/Performance 2006: 109-120 - 2005
- [c4]Esa Hyytiä, Pasi E. Lassila, Aleksi Penttinen, János Roszik:
Traffic load in a dense wireless multihop network. PE-WASUN 2005: 9-17 - 2004
- [c3]Aleksi Penttinen:
Efficient multicast tree algorithm for ad hoc networks. MASS 2004: 519-521 - [c2]Aleksi Penttinen, Jorma T. Virtamo:
Performance of Wireless Ad Hoc Networks under Balanced Fairness. NETWORKING 2004: 235-246 - 2003
- [c1]Aleksi Penttinen, Jorma T. Virtamo:
Improving Multicast Tree Construction in Static Ad Hoc Networks. LCN 2003: 762-765
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:09 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:
