Lin Chen

Orcid: 0000-0003-3909-4916

Affiliations:
  • Zhejiang University, Hangzhou, China
  • Texas Tech University, Department of Computer Science, Lubbock, TX, USA (former)
  • University of Houston, Department of Computer Science, TX, USA (former)
  • Hungarian Academy of Sciences, Budapest, Hungary (2016)
  • Technical University of Munich, Department of Mathematics, Garching, Germany (2015)
  • Technical University of Berlin, Germany (2013-2015)
  • Zhejiang University, Hangzhou, China (2008-2013, PhD 2013)


According to our database1, Lin Chen authored at least 106 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
FPT algorithms for a special block-structured integer program with applications in scheduling.
Math. Program., November, 2024

DIaC: Re-Imagining Decentralized Infrastructure as Code Using Blockchain.
IEEE Trans. Netw. Serv. Manag., April, 2024

A Game Theoretical Analysis of Non-linear Blockchain System.
Distributed Ledger Technol. Res. Pract., March, 2024

Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints.
Eur. J. Oper. Res., 2024

Approximating Partition in Near-Linear Time.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

A Nearly Quadratic-Time FPTAS for Knapsack.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Decentralized FaaS over Multi-Clouds with Blockchain based Management for Supporting Emerging Applications.
Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing, 2024

Revisit the Scheduling Problem with Calibrations.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

TPU as Cryptographic Accelerator.
Proceedings of the 13th International Workshop on Hardware and Architectural Support for Security and Privacy, 2024

An Improved Pseudopolynomial Time Algorithm for Subset Sum.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023
Electoral manipulation via influence: probabilistic model.
Auton. Agents Multi Agent Syst., June, 2023

Solving the shortest path interdiction problem via reinforcement learning.
Int. J. Prod. Res., 2023

TPU as Cryptographic Accelerator.
CoRR, 2023

Cross Chain Bribery Contracts: Majority vs Mighty Minority.
CoRR, 2023

Optimally Blending Honeypots into Production Networks: Hardness and Algorithms.
Proceedings of the Science of Cyber Security - 5th International Conference, 2023

DeFaaS: Decentralized Function-as-a-Service for Emerging dApps and Web3.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

DHTee: Decentralized Infrastructure for Heterogeneous TEEs.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2023

Decentralized Translator of Trust: Supporting Heterogeneous TEE for Critical Infrastructure Protection.
Proceedings of the 5th ACM International Symposium on Blockchain and Secure Critical Infrastructure, 2023

2022
Block-structured integer programming: Can we parameterize without the largest coefficient?
Discret. Optim., 2022

Audit and Improve Robustness of Private Neural Networks on Encrypted Data.
CoRR, 2022

Tight running times for minimum <italic>ℓ<sub>q</sub></italic>-norm load balancing: beyond exponential dependencies on 1/<italic>∊</italic>.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Local Differential Privacy Meets Computational Social Choice - Resilience under Voter Deletion.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Decentralized Application Infrastructures as Smart Contract Codes.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2022

Approximation Algorithms for Interdiction Problem with Packing Constraints.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

How Hard is Bribery in Elections with Randomly Selected Voters.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Computational complexity characterization of protecting elections from bribery.
Theor. Comput. Sci., 2021

Scheduling with variable-length calibrations: Two agreeable variants.
Theor. Comput. Sci., 2021

On the price of anarchy of two-stage machine scheduling games.
J. Comb. Optim., 2021

A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions.
Eur. J. Oper. Res., 2021

Tight running times for minimum 𝓁<sub>p</sub>-norm load balancing: beyond exponential dependencies on 1/ε.
CoRR, 2021

EDSC: An Event-Driven Smart Contract Platform.
CoRR, 2021

Reshaping the Landscape of the Future: Software-Defined Manufacturing.
Computer, 2021

Optimal algorithms for scheduling under time-of-use tariffs.
Ann. Oper. Res., 2021

Privacy preserving event based transaction system in a decentralized environment.
Proceedings of the Middleware '21: 22nd International Middleware Conference, Québec City, Canada, December 6, 2021

Lessons Learned from Blockchain Applications of Trusted Execution Environments and Implications for Future Research.
Proceedings of the HASP '21: Workshop on Hardware and Architectural Support for Security and Privacy, 2021

On Conditional Cryptocurrency With Privacy.
Proceedings of the IEEE International Conference on Blockchain and Cryptocurrency, 2021

Hardness and Algorithms for Electoral Manipulation Under Media Influence.
Proceedings of the Frontiers of Algorithmics - International Joint Conference, 2021

An event driven framework for smart contract execution.
Proceedings of the 15th ACM International Conference on Distributed and Event-based Systems, 2021

Scheduling Stochastic Jobs - Complexity and Approximation Algorithms.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
DIoTA: Decentralized-Ledger-Based Framework for Data Authenticity Protection in IoT Systems.
IEEE Netw., 2020

A general framework for handling commitment in online throughput maximization.
Math. Program., 2020

Hybrid Cryptocurrency Pump and Dump Detection.
CoRR, 2020

Nonlinear Blockchain Scalability: a Game-Theoretic Perspective.
CoRR, 2020

Supporting Blockchain-Based Cryptocurrency Mobile Payment With Smart Devices.
IEEE Consumer Electron. Mag., 2020

Blockchain based End-to-end Tracking System for Distributed IoT Intelligence Application Security Enhancement.
Proceedings of the 19th IEEE International Conference on Trust, 2020

FPGA based Blockchain System for Industrial IoT.
Proceedings of the 19th IEEE International Conference on Trust, 2020

PrivateEx: privacy preserving exchange of crypto-assets on blockchain.
Proceedings of the SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30, 2020

New Bounds on Augmenting Steps of Block-Structured Integer Programs.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

DL-DP: Improving the Security of Industrial IoT with Decentralized Ledger Defined Perimeter.
Proceedings of the BSCI '20: Proceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure, 2020

Scheduling Many Types of Calibrations.
Proceedings of the Algorithmic Aspects in Information and Management, 2020

2019
Scheduling maintenance jobs in networks.
Theor. Comput. Sci., 2019

Private and Atomic Exchange of Assets over Zero Knowledge Based Payment Ledger.
CoRR, 2019

Covering a tree with rooted subtrees.
CoRR, 2019

Approximation of Scheduling with Calibrations on Multiple Machines (Brief Announcement).
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Cross Chain Bribery Contracts: Majority vs Mighty Minority.
Proceedings of the Highlights of Practical Applications of Survivable Agents and Multi-Agent Systems. The PAAMS Collection, 2019

Election with Bribe-Effect Uncertainty: A Dichotomy Result.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

KCRS: A Blockchain-Based Key Compromise Resilient Signature System.
Proceedings of the Blockchain and Trustworthy Systems - First International Conference, 2019

Virtual Big Data for GAN Based Data Augmentation.
Proceedings of the 2019 IEEE International Conference on Big Data (IEEE BigData), 2019

Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Packing Groups of Items into Multiple Knapsacks.
ACM Trans. Algorithms, 2018

An O(log m)-Competitive Algorithm for Online Machine Minimization.
SIAM J. Comput., 2018

Efficient Public Blockchain Client for Lightweight Users.
EAI Endorsed Trans. Security Safety, 2018

CoC: A Unified Distributed Ledger Based Supply Chain Management System.
J. Comput. Sci. Technol., 2018

On the optimality of exact and approximation algorithms for scheduling problems.
J. Comput. Syst. Sci., 2018

Tyranny of the Majority: On the (Im)possibility of Correctness of Smart Contracts.
IEEE Secur. Priv., 2018

Parallel machine scheduling with speed-up resources.
Eur. J. Oper. Res., 2018

On the NP-hardness of scheduling with time restrictions.
Discret. Optim., 2018

On the Graver basis of block-structured integer programming.
CoRR, 2018

Covering a tree with rooted subtrees - parameterized and approximation algorithms.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Blockchain-based Identity Management with Mobile Device.
Proceedings of the 1st Workshop on Cryptocurrencies and Blockchains for Distributed Systems, 2018

The Game Among Bribers in a Smart Contract System.
Proceedings of the Financial Cryptography and Data Security, 2018

Protecting Early Stage Proof-of-Work Based Public Blockchain.
Proceedings of the 48th Annual IEEE/IFIP International Conference on Dependable Systems and Networks Workshops, 2018

Proving Conditional Termination for Smart Contracts.
Proceedings of the 2nd ACM Workshop on Blockchains, Cryptocurrencies, and Contracts, 2018

Protecting Election from Bribery: New Approach and Computational Complexity Characterization.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
DL-BAC: Distributed Ledger Based Access Control for Web Applications.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Security Analysis of Proof-of-Elapsed-Time (PoET).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2017

EPBC: Efficient Public Blockchain Client for lightweight users.
Proceedings of the 1st Workshop on Scalable and Resilient Infrastructures for Distributed Ledgers, 2017

Smart Contract Execution - the (+-)-Biased Ballot Problem.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Scalable Blockchain Based Smart Contract Execution.
Proceedings of the 23rd IEEE International Conference on Parallel and Distributed Systems, 2017

CoC: Secure Supply Chain Management System Based on Public Ledger.
Proceedings of the 26th International Conference on Computer Communication and Networks, 2017

Decentralized Execution of Smart Contracts: Agent Model Perspective and Its Implications.
Proceedings of the Financial Cryptography and Data Security, 2017

The Price of Anarchy in Two-Stage Scheduling Games.
Proceedings of the Combinatorial Optimization and Applications, 2017

2016
The Power of Migration in Online Machine Minimization.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

An O(log <i>m</i>)-Competitive Algorithm for Online Machine Minimization.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints.
Proceedings of the Combinatorial Optimization and Applications, 2016

Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources.
Proceedings of the Approximation, 2016

2015
An asymptotic competitive scheme for online bin packing.
Theor. Comput. Sci., 2015

An O(m^2 log m)-Competitive Algorithm for Online Machine Minimization.
CoRR, 2015

Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming.
Asia Pac. J. Oper. Res., 2015

Optimal Algorithms and a PTAS for Cost-Aware Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Stochastic and Robust Scheduling in the Cloud.
Proceedings of the Approximation, 2015

2014
An improved lower bound for rank four scheduling.
Oper. Res. Lett., 2014

Online Scheduling of mixed CPU-GPU jobs.
Int. J. Found. Comput. Sci., 2014

New Results on Online Resource Minimization.
CoRR, 2014

On the optimality of approximation schemes for the classical scheduling problem.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
Approximation algorithms for a bi-level knapsack problem.
Theor. Comput. Sci., 2013

Approximating the optimal competitive ratio for an ancient online scheduling problem
CoRR, 2013

A note on scheduling with low rank processing times.
CoRR, 2013

Online Scheduling on a CPU-GPU Cluster.
Proceedings of the Theory and Applications of Models of Computation, 2013

2012
Approximation schemes for two-machine flow shop scheduling with two agents.
J. Comb. Optim., 2012

2011
Scheduling on two identical machines with a speed-up resource.
Inf. Process. Lett., 2011

Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010
Approximation Algorithms for Scheduling with a Variable Machine Maintenance.
Proceedings of the Algorithmic Aspects in Information and Management, 2010


  Loading...