default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID55th Allerton Conference 2017: Monticello, IL, USA
- 55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017. IEEE 2017, ISBN 978-1-5386-3266-6
- Islam Samy, Onur Ozan Koyluoglu, Ankit Singh Rawat:
Efficient data access in hybrid cloud storage. 1-8 - Serge Kas Hanna, Salim El Rouayheb:
Correcting bursty and localized deletions using guess & check codes. 9-16 - Mehmet S. Aktas
, Sarah E. Anderson, Ann Johnston, Gauri Joshi, Swanand Kadhe, Gretchen L. Matthews, Carolyn Mayer, Emina Soljanin:
On the service capacity region of accessing erasure coded content. 17-24 - Swanand Kadhe, Alex Sprintson:
Universally weakly secure coset coding schemes for minimum storage regenerating (MSR) codes. 25-30 - Nematollah Iri, Oliver Kosut:
Fundamental limits of universal variable-to-fixed length coding of parametric sources. 31-37 - Ashish Cherukuri, Jorge Cortés:
Data-driven distributed optimization using Wasserstein ambiguity sets. 38-44 - Payam Delgosha, Venkat Anantharam:
Load balancing in hypergraphs. 45-52 - Mehdi Molkaraie:
The primal versus the dual ising model. 53-60 - Ilya Soloveychik, Vahid Tarokh:
On the spectral norms of pseudo-wigner and related matrices. 61-66 - Islam El Bakoury, Bobak Nazer:
Integer-forcing architectures for uplink cloud radio access networks. 67-75 - Timothy J. O'Shea, Tugba Erpek, T. Charles Clancy:
Physical layer deep learning of encodings for the MIMO fading channel. 76-80 - Manik Singhal, Aly El Gamal:
Joint uplink-downlink cell associations for interference networks with local connectivity. 81-88 - Yahya H. Ezzeldin, Martina Cardone, Christina Fragouli, Daniela Tuninetti:
Half-duplex routing is NP-hard. 89-96 - Marcos M. Vasconcelos, Urbashi Mitra:
The multiple-access collision channel without feedback: Capacity region and a mutual information game. 97-102 - Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia:
Two-transmitter two-receiver channel with confidential messages. 103-110 - Nizar Khalfet, Samir Medina Perlaza:
Simultaneous information and energy transmission in Gaussian interference channels with feedback. 111-117 - Jingbo Liu, Paul Cuff, Sergio Verdú:
On α-decodability and α-likelihood decoder. 118-124 - Seiyun Shin, Changho Suh:
Capacity of a two-way function multicast channel. 125-133 - Fei Wei, Michael Langberg:
The effect of removing a network communication edge: Group network codes. 134-141 - Bernard C. Lesieutre, Sandip Roy:
Calculating and calibrating a persistence measure for use in monitoring power system vulnerability. 142-148 - Mengqi Yao, Daniel K. Molzahn, Johanna L. Mathieu:
The impact of load models in an algorithm for improving voltage stability via demand response. 149-156 - Victor Purba, Sairaj V. Dhople, Saber Jafarpour, Francesco Bullo, Brian B. Johnson:
Network-cognizant model reduction of grid-tied three-phase inverters. 157-164 - Apostolos I. Rikos, Christoforos N. Hadjicostis:
Distributed flow balancing over unreliable communication links. 165-172 - Tao Sun, Lang Tong:
Killing death spiral softly with a small connection charge. 173-179 - Greg Ver Steeg, Rob Brekelmans, Hrayr Harutyunyan, Aram Galstyan:
Disentangled representations via synergy minimization. 180-187 - Michael J. Neely:
Optimal convergence and adaptation for utility optimal opportunistic scheduling. 188-195 - Tho Ngoc Le, Vijay G. Subramanian, Randall A. Berry:
Learning from randomly arriving agents. 196-197 - Angelia Nedic, Tatiana Tatarenko:
On stochastic proximal-point method for convex-composite optimization. 198-203 - Tian Tong, Rohit Negi:
Supermajority sentiment detection with external influence in large social networks. 204-211 - Sina Molavipour, Germán Bassi, Mikael Skoglund:
Testing for directed information graphs. 212-219 - John A. W. B. Costanzo, Donatello Materassi, Bruno Sinopoli:
Inferring link changes in dynamic networks through power spectral density variations. 220-227 - Shahin Shahrampour, Vahid Tarokh:
Nonlinear sequential accepts and rejects for identification of top arms in stochastic bandits. 228-235 - Ming Jin, Javad Lavaei, Karl Henrik Johansson:
A semidefinite programming relaxation under false data injection attacks against power grid AC state estimation. 236-243 - Ioannis Tzortzis, Christoforos N. Hadjicostis, Laurent Mombaerts:
Reconstruction of gene regulatory networks using an error filtering learning scheme. 244-251 - Ahmed H. Anwar, George K. Atia, Mina Guirguis:
Dynamic game-theoretic defense approach against stealthy Jamming attacks in wireless networks. 252-258 - Emily Meigs, Francesca Parise, Asuman E. Ozdaglar:
Learning dynamics in stochastic routing games. 259-266 - Mengran Xue, Sandip Roy:
A stochastic flow network model with almost-fractional routing. 267-274 - Brian Swenson, Soummya Kar:
On the exponential rate of convergence of fictitious play in potential games. 275-279 - Parinaz Naghizadeh, Mingyan Liu:
On the uniqueness and stability of equilibria of network games. 280-286 - Mohammad Hajimirsadeghi, Narayan B. Mandayam:
A dynamic colonel blotto game model for spectrum sharing in wireless networks. 287-294 - Yuzhang Lin, Ali Abur:
Identifying security vulnerabilities of weakly detectable network parameter errors. 295-301 - Abdullah Al-Digs, Sairaj V. Dhople, Yu Christine Chen:
Time-varying injection shift factors to predict post-contingency dynamic line flows. 302-306 - Chin-Yao Chang, Sonia Martínez, Jorge Cortés:
Convex relaxation for mixed-integer optimal power flow problems. 307-314 - Byungkwon Park, Christopher L. DeMarco:
Sparse tableau relaxation for the optimal power flow problem. 315-323 - Fernando Paganini, Enrique Mallada:
Global performance metrics for synchronization of heterogeneously rated power systems: The role of machine models and inertia. 324-331 - Mostafa Rahmani, George K. Atia:
Robust PCA with concurrent column and element-wise outliers. 332-337 - Sulaiman A. Alghunaim, Kun Yuan, Ali H. Sayed:
Decentralized exact coupled optimization. 338-345 - Dhruva Mokhasunavisu, Urbashi Mitra:
Non-parametric active target localization: Exploiting unimodality and separability. 346-353 - Mahyar Fazlyab, Alejandro Ribeiro, Manfred Morari, Victor M. Preciado:
A dynamical systems perspective to convergence rate analysis of proximal algorithms. 354-360 - Kai Wan, Mingyue Ji, Pablo Piantanida, Daniela Tuninetti:
Novel inner bounds with uncoded cache placement for combination networks with end-user-caches. 361-368 - Mahsa Lotfi, Mathukumalli Vidyasagar:
A fast single-pass algorithm for compressive sensing based on binary measurement matrices. 369-373 - Ryan Pilgrim, Junan Zhu, Dror Baron, Waheed U. Bajwa:
Generalized geometric programming for rate allocation in consensus. 374-381 - Liang Wu, Hemanshu Roy Pota, Ian R. Petersen:
Bounded phase synchronization of multirate kuramoto networks through decentralised or distributed control. 382-389 - Ivo Kubjas, Vitaly Skachek:
Two-party function computation on the reconciled data. 390-396 - Virag Shah, Anne Bouillard, François Baccelli:
Delay comparison of delivery and coding policies in data clusters. 397-404 - Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou:
Longest alignment with edits in data streams. 405-412 - Anastasios Tsiamis, Sérgio Pequito, George J. Pappas:
Distributed leader selection in switching networks of high-order integrators. 413-420 - Su Li, Abhin Shah, Michael Gastpar:
Cooperative data exchange with weighted cost based on d-basis construction. 421-428 - Ning Zheng, Qing Li:
Joint decoding of RAID-ECC solutions for SSDs. 429-436 - Yi-Peng Wei, Sennur Ulukus:
Coded caching with multiple file requests. 437-442 - Furkan Ercan, Carlo Condo, Seyyed Ali Hashemi, Warren J. Gross:
On error-correction performance and implementation of polar code list decoders for 5G. 443-449 - Chih-Chun Wang, David J. Love, Dennis Ogbe:
Transcoding: A new strategy for relay channels. 450-454 - Jing Li, Dongning Guo:
Cloud-based resource allocation and cooperative transmission in large cellular networks. 455-462 - Jing Zhong, Emina Soljanin, Roy D. Yates:
Status updates through multicast networks. 463-469 - Farhad Shirani, Siddharth Garg, Elza Erkip:
An information theoretic framework for active de-anonymization in social networks based on group memberships. 470-477 - Soheil Eshghi, Grace-Rose Williams, Gualtiero B. Colombo, Liam D. Turner, David G. Rand, Roger M. Whitaker, Leandros Tassiulas:
Stability and fracture of social groups. 478-485 - Rajat Talak, Sertac Karaman, Eytan H. Modiano:
Minimizing age-of-information in multi-hop wireless networks. 486-493 - Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Coded fourier transform. 494-501 - Fabio Cecchi, Sem C. Borst, Johan S. H. van Leeuwaarden, Philip A. Whiting:
Spatial mean-field limits for CSMA networks. 502-509 - Abishek Sankararaman, François Baccelli:
Community detection on euclidean random graphs. 510-517 - Erfan Yazdandoost Hamedani, Necdet Serhat Aybat:
Multi-agent constrained optimization of a strongly convex function over time-varying directed networks. 518-525 - Hoi-To Wai, Wei Shi, Angelia Nedic, Anna Scaglione:
Curvature-aided incremental aggregated gradient method. 526-532 - Shubhanshu Shekhar, Tara Javidi:
Bayesian function optimization with adaptive discretization. 533-540 - Wei Wu, Bing Fan, Paul H. Siegel:
Generalized partial orders for polar code bit-channels. 541-548 - Amirsina Torfi, Sobhan Soleymani, Siamak Aram, Vahid Tabataba Vakili:
On the construction of polar codes for achieving the capacity of marginal channels. 549-556 - Christopher Schnelling, Yassine Amraue, Anke Schmeink:
On iterative decoding of polar codes: Schedule-dependent performance and constructions. 557-564 - Alankrita Bhatt, Nadim Ghaddar, Lele Wang:
Polar coding for multiple descriptions using monotone chain rules. 565-571 - Kuangda Tian, Arman Fazeli, Alexander Vardy, Rongke Liu:
Polar codes for channels with deletions. 572-579 - Sarah A. Obead, Jörg Kliewer, Badri N. Vellambi:
Joint coordination-channel coding for strong coordination over noisy channels based on polar codes. 580-587 - Dong Yin, Ramtin Pedarsani, Yudong Chen, Kannan Ramchandran:
Learning mixtures of sparse linear regressions using sparse graph codes. 588-595 - Fatemeh Sheikholeslami, Georgios B. Giannakis:
Scalable kernel-based learning via low-rank approximation of lifted data. 596-603 - Morteza Ashraphijuo, Xiaodong Wang, Vaneet Aggarwal:
An approximation of the CP-rank of a partially sampled tensor. 604-611 - Anna C. Gilbert, Lalit Jain:
If it ain't broke, don't fix it: Sparse metric repair. 612-619 - S. Amir Hosseini, Shivendra S. Panwar:
Restless streaming bandits: Scheduling scalable video in wireless networks. 620-628 - Jie Chen, Wenyi Zhang, H. Vincent Poor:
An FDR-oriented approach to multiple sequential fault detection and isolation. 629-633 - Andrey Gurevich, Kobi Cohen, Qing Zhao:
Anomaly detection under a nonlinear system cost objective function. 634-638 - Amir Ajorlou, Ali Jadbabaie:
A game theoretic approach to promotion design in two-sided platforms. 639-641 - Meysam Asadi, Natasha Devroye:
On the zero-error capacity of channels with noisy feedback. 642-649 - Xiaoqing Fan, Aaron B. Wagner:
Gaussian variable packet-error coding. 650-657 - Huseyin A. Inan, Peter Kairouz, Ayfer Özgür:
Sparse group testing codes for low-energy massive random access. 658-665 - Damian Straszak, Nisheeth K. Vishnoi:
Belief propagation, bethe approximation and polynomials. 666-671 - Allison Beemer, Salman Habib, Christine A. Kelley, Jörg Kliewer:
A generalized algebraic approach to optimizing SC-LDPC codes. 672-679 - Pulakesh Upadhyaya, Anxiao Andrew Jiang:
On LDPC decoding with natural redundancy. 680-687 - Xin Xiao, Mona Nasseri, Bane Vasic, Shu Lin:
Serial concatenation of reed muller and LDPC codes with low error floor. 688-693 - Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello Jr., Thomas E. Fuja:
Lower bounds for quantized LDPC min-sum decoders based on absorbing sets. 694-699 - Anxiao Andrew Jiang, Pulakesh Upadhyaya, Ying Wang, Krishna R. Narayanan, Hongchao Zhou, Jin Sima, Jehoshua Bruck:
Stopping set elimination for LDPC codes. 700-707 - Praneeth Tota, Sanjiv Kapoor, Benjamin Grimmer:
Economic inefficiency in resource allocation games. 708-715 - Susana Iglesias Rey, Patricio Reyes, Alonso Silva:
Evolution of social power for opinion dynamics networks. 716-723 - Soham R. Phade, Venkat Anantharam:
On the geometry of nash and correlated equilibria with cumulative prospect theoretic preferences. 724-731 - Yuke Li, Fengjiao Liu, A. Stephen Morse:
A distributed, dynamical system view of finite, static games. 732-738 - Ali Makhdoumi, Azarakhsh Malekian, Asuman E. Ozdaglar:
Optimal pricing policy of network goods. 739-743 - Ali Mousavi, Gautam Dasarathy, Richard G. Baraniuk:
DeepCodec: Adaptive sensing and recovery via deep convolutional neural networks. 744 - Yilong Geng, Shiyu Liu, Feiran Wang, Zi Yin, Balaji Prabhakar, Mendel Rosenblum:
Self-programming networks: Architecture and algorithms. 745-752 - Virag Shah, Lennart Gulikers, Laurent Massoulié, Milan Vojnovic:
Adaptive matching for expert systems with uncertain task types. 753-760 - Weixuan Lin, John Z. F. Pang, Eilyan Bitar, Adam Wierman:
Networked cournot competition in platform markets. 761 - Philip Wong, Mahnoosh Alizadeh:
Congestion control and pricing in a network of electric vehicle public charging stations. 762-769 - Rabih Salhab, Jerome Le Ny, Roland P. Malhamé:
A dynamic ride-sourcing game with many drivers. 770-775 - Pooyan Ehsani, Jia Yuan Yu:
The merits of sharing a ride. 776-782 - Namrata Vaswani, Praneeth Narayanamurthy:
Finite sample guarantees for PCA in non-isotropic and data-dependent noise. 783-789 - Daniel L. Pimentel-Alarcón, Gregory Ongie, Laura Balzano, Rebecca Willett, Robert D. Nowak:
Low algebraic dimension matrix completion. 790-797 - Jun Zhao:
Relations among different privacy notions. 798-805 - Jeff Cooper, Lev Reyzin:
Improved algorithms for distributed boosting. 806-813 - Shuang Song, Kamalika Chaudhuri:
Composition properties of inferential privacy for time-series data. 814-821 - Hussein Saad, Ahmed Attia Abotabl, Aria Nosratinia:
Exact recovery in the binary stochastic block model with binary side information. 822-829 - Jean Honorio:
On the sample complexity of learning graphical games. 830-836 - Eric Graves:
Communications over a state dependent channel, when the channel state and message are dependent. 837-843 - Leighton Pate Barnes, Xiugang Wu, Ayfer Özgür:
A solution to cover's problem for the binary symmetric relay channel: Geometry of sets on the hamming sphere. 844-851 - Nirmal V. Shende, Aaron B. Wagner:
On very noisy channels with feedback. 852-859 - Mustafa Sungkar, Toby Berger, William B. Levy:
Capacity achieving input distribution to the generalized inverse Gaussian neuron model. 860-869 - Assaf Ben-Yishai, Ofer Shayevitz, Young-Han Kim:
Interactive coding for Markovian protocols. 870-877 - Mohsen Bahrami, Mohamed Adel Attia, Ravi Tandon, Bane Vasic:
Towards the exact rate-memory trade-off for uncoded caching with secure delivery. 878-885 - Hao Wang, Flávio P. Calmon:
An estimation-theoretic view of privacy. 886-893 - Ahmed Attia Abotabl, Aria Nosratinia:
Achieving the secrecy capacity of the AWGN wiretap channel via multilevel coding. 894-901 - Ruoxi Jia, Roy Dong, Prashanth Ganesh, Shankar Sastry, Costas J. Spanos:
Towards a theory of free-lunch privacy in cyber-physical systems. 902-910 - Bharadwaj Satchidanandan, P. R. Kumar:
The securable subspace of a linear stochastic system with malicious sensors and actuators. 911-917 - Linqi Guo, Chen Liang, Steven H. Low:
Monotonicity properties and spectral characterization of power redistribution in cascading failures. 918-925 - Mohammad Mahdi Khalili, Parinaz Naghizadeh, Mingyan Liu:
Embracing risk dependency in designing cyber-insurance contracts. 926-933 - Mehran Elyasi, Soheil Mohajer:
Exact-repair trade-off for (n, k = d - 1, d) regenerating codes. 934-941 - Weiqi Li, Zhiying Wang, Hamid Jafarkhani:
A tradeoff between the sub-packetization size and the repair bandwidth for reed-solomon code. 942-949 - Ameera Chowdhury, Alexander Vardy:
Improved schemes for asymptotically optimal repair of MDS codes. 950-957 - Dario Paccagnan, Jason R. Marden:
The risks and rewards of conditioning noncooperative designs to additional information. 958-965 - Sean Weerakkody, Omur Ozel, Bruno Sinopoli:
A Bernoulli-Gaussian physical watermark for detecting integrity attacks in control systems. 966-973 - Shuai Ma, Jia Yuan Yu:
Transition-based versus state-based reward functions for MDPs with Value-at-Risk. 974-981 - James Anderson, Nikolai Matni:
Structured state space realizations for SLS distributed controllers. 982-987 - David Fridovich-Keil, Nathan Hanford, Margaret P. Chapman, Claire J. Tomlin, Matthew K. Farrens, Dipak Ghosal:
A model predictive control approach to flow pacing for TCP. 988-994 - Guangliang Zhao, Zhixin Yang, Quan Yuan, Le Yi Wang:
Controllability of stochastic differential equations with Markovian switching. 995-999 - Alon Kipnis, John C. Duchi:
Mean estimation from adaptive one-bit measurements. 1000-1007 - Arman Rezaee, Ahmad Beirami, Ali Makhdoumi, Muriel Médard, Ken Duffy:
Guesswork subject to a total entropy budget. 1008-1015 - Aditya Gangrade, Bobak Nazer, Venkatesh Saligrama:
Lower bounds for two-sample structural change detection in ising and Gaussian models. 1016-1025 - Michael Bell, Yuval Kochman:
On composite binary hypothesis testing with training data. 1026-1033 - Alex Dytso, Ronit Bustin, H. Vincent Poor, Shlomo Shamai Shitz:
On the equality condition for the I-MMSE proof of the entropy power inequality. 1034-1039 - Ali Moharrer, Shuangqing Wei:
Algebraic properties of solutions to common information of Gaussian vectors under sparse graphical constraints. 1040-1047 - Andre Manoel, Florent Krzakala, Eric W. Tramel, Lenka Zdeborová:
Streaming Bayesian inference: Theoretical limits and mini-batch approximate message-passing. 1048-1055 - Jean Barbier, Nicolas Macris, Léo Miolane:
The layered structure of tensor estimation and its mutual information. 1056-1063 - Galen Reeves:
Additivity of information in multilayer networks via additive Gaussian noise transforms. 1064-1070 - Oussama Dhifallah, Christos Thrampoulidis, Yue M. Lu:
Phase retrieval via linear programming: Fundamental limits and algorithmic improvements. 1071-1077 - Ravi Tandon:
The capacity of cache aided private information retrieval. 1078-1082 - Qiwen Wang, Mikael Skoglund:
Secure symmetric private information retrieval from colluding databases with adversaries. 1083-1090 - Karim A. Banawan, Sennur Ulukus:
Private information retrieval from Byzantine and colluding databases. 1091-1098 - Swanand Kadhe, Brenden Garcia, Anoosheh Heidarzadeh, Salim Y. El Rouayheb, Alex Sprintson:
Private information retrieval with side information: The single server case. 1099-1106 - Alisha Zachariah, Zachary Charles:
Efficiently finding all power flow solutions to tree networks. 1107-1114 - Venkata Gandikota, Elena Grigorescu, Clayton Thomas, Minshen Zhu:
Maximally recoverable codes: The bounded case. 1115-1122 - Pengfei Huang, Eitan Yaakobi, Paul H. Siegel:
Multi-erasure locally recoverable codes over small fields. 1123-1130 - Reyna Hulett, Mary Wootters:
Limitations of piggybacking codes with low substriping. 1131-1138 - Ryan Gabrys, Farzad Farnoud Hassanzadeh:
Reconciling similar sets. 1139-1144 - Burak Bartan, Mary Wootters:
Repairing multiple failures for scalar MDS codes. 1145-1152 - Roman Pogodin, Mikhail Krechetov, Yury Maximov:
Efficient rank minimization to tighten semidefinite programming for unconstrained binary quadratic optimization. 1153-1159 - Wenjie Li, Mohamad Assaad, Pierre Duhamel:
Distributed stochastic optimization in networks with low informational exchange. 1160-1167 - Andreea B. Alexandru, Konstantinos Gatsis, George J. Pappas:
Privacy preserving cloud-based quadratic optimization. 1168-1175 - Le Thi Khanh Hien, William B. Haskell:
Sequential smoothing framework for convex-concave saddle point problems with application to large-scale constrained optimization. 1176-1183 - William B. Haskell, Rahul Jain:
Inexact iteration of averaged operators for non-strongly convex stochastic optimization. 1184-1191 - Víctor Valls, Douglas J. Leith:
Asynchronous primal updates in dual subgradient methods via approximate lagrange multipliers. 1192-1197 - Yi Ouyang, Mukul Gagrani, Rahul Jain:
Control of unknown linear systems with Thompson sampling. 1198-1205 - Akhil Sundararajan, Bin Hu, Laurent Lessard:
Robust convergence analysis of distributed optimization algorithms. 1206-1212 - Libin Liu, Arpan Chattopadhyay, Urbashi Mitra:
On exploiting spectral properties for solving MDP with large state space. 1213-1219 - Yuansi Chen, Raaz Dwivedi, Martin J. Wainwright, Bin Yu:
Vaidya walk: A sampling algorithm based on the volumetric barrier. 1220-1227 - Arman Rahimzamani, Sreeram Kannan:
Potential conditional mutual information: Estimators and properties. 1228-1235 - Soyeon Ahn, Ziqi Ke, Haris Vikalo:
Viral quasispecies reconstruction via tensor factorization. 1236-1239 - Jingge Zhu, Ye Pu, Vipul Gupta, Claire J. Tomlin, Kannan Ramchandran:
A sequential approximation framework for coded distributed optimization. 1240-1247 - Shahroze Kabir, Frederic Sala, Guy Van den Broeck, Lara Dolecek:
Coded machine learning: Joint informed replication and learning for linear regression. 1248-1255 - Amirhossein Reisizadeh, Ramtin Pedarsani:
Latency analysis of coded computation schemes over wireless networks. 1256-1263 - Mohammad Fahim, Haewon Jeong, Farzin Haddadpour, Sanghamitra Dutta, Viveck R. Cadambe, Pulkit Grover:
On the optimal recovery threshold of coded matrix multiplication. 1264-1270 - Geewon Suh, Kangwook Lee, Changho Suh:
Matrix sparsification for coded matrix multiplication. 1271-1278 - Sanmay Das, Emir Kamenica, Renee Mirka:
Reducing congestion through information design. 1279-1284 - Hamidreza Tavafoghi, Demosthenis Teneketzis:
Informational incentives for congestion games. 1285-1292 - Jonathan Epperlein, Jakub Marecek:
Resource allocation with population dynamics. 1293-1300
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.
last updated on 2026-01-13 00:41 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:
