Chi-Jen Lu

According to our database1, Chi-Jen Lu authored at least 64 papers between 1990 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
On the Algorithmic Power of Spiking Neural Networks.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Online Linear Optimization with Sparsity Constraints.
Proceedings of the Algorithmic Learning Theory, 2019

Lifelong Optimization with Low Regret.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
The Communication Complexity of Graphical Games on Grid Graphs.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Efficient Mechanisms for Peer Grading and Dueling Bandits.
Proceedings of The 10th Asian Conference on Machine Learning, 2018

2017
Online Reinforcement Learning in Stochastic Games.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Tensor Decomposition via Simultaneous Power Iteration.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games.
Oper. Res. Lett., 2016

Generalized mirror descents in congestion games.
Artif. Intell., 2016

Tracking the Best Expert in Non-stationary Stochastic Environments.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Rivalry of Two Families of Algorithms for Memory-Restricted Streaming PCA.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Playing Congestion Games with Bandit Feedbacks.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

Online Learning in Markov Decision Processes with Continuous Actions.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2014
A communication-efficient private matching scheme in Client-Server model.
Inf. Sci., 2014

Boosting with Online Binary Learners for the Multiclass Bandit Problem.
Proceedings of the 31th International Conference on Machine Learning, 2014

Generalized mirror descents in congestion games with splittable flows.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Pseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions.
Proceedings of the Sixth Asian Conference on Machine Learning, 2014

2013
Beating Bandits in Gradually Evolving Worlds.
Proceedings of the COLT 2013, 2013

2012
Online Optimization with Gradual Variations.
Proceedings of the COLT 2012, 2012

An Online Boosting Algorithm with Theoretical Justifications.
Proceedings of the 29th International Conference on Machine Learning, 2012

Making Profit in a Prediction Market.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Hitting Set Generators for Sparse Polynomials over Any Finite Fields.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Complexity of Hard-Core Set Proofs.
Computational Complexity, 2011

Computational Randomness from Generalized Hardcore Sets.
Proceedings of the Fundamentals of Computation Theory - 18th International Symposium, 2011

Making Online Decisions with Bounded Memory.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
Tree Decomposition for Large-Scale SVM Problems.
J. Mach. Learn. Res., 2010

Online Learning with Queries.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

On the Hardness against Constant-Depth Linear-Size Circuits.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

Communication Requirements for Stable Marriages.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

Efficient String-Commitment from Weak Bit-Commitment.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

2009
Efficient algorithms for two generalized 2-median problems and the group median problem on trees.
Theor. Comput. Sci., 2009

On the Security Loss in Cryptographic Reductions.
Proceedings of the Advances in Cryptology, 2009

Extracting Computational Entropy and Learning Noisy Linear Functions.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Secure PRNGs from Specialized Polynomial Maps over Any .
Proceedings of the Post-Quantum Cryptography, Second International Workshop, 2008

2007
Improved hardness amplification in NP.
Theor. Comput. Sci., 2007

Secure PRNGs from Specialized Polynomial Maps over Any Fq.
IACR Cryptology ePrint Archive, 2007

On the Complexity of Hard-Core Set Constructions.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Impossibility Results on Weakly Black-Box Hardness Amplification.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility.
Proceedings of the Advances in Cryptology, 2007

2006
The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives.
J. Cryptology, 2006

Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies.
J. Mach. Learn. Res., 2006

On the Complexity of Parallel Hardness Amplification for One-Way Functions.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Deterministic Extractors for Independent-Symbol Sources.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Extracting randomness from multiple independent sources.
IEEE Trans. Information Theory, 2005

On the Complexity of Hardness Amplification.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors.
J. Cryptology, 2004

A linear-time component-labeling algorithm using contour tracing technique.
Computer Vision and Image Understanding, 2004

2003
Extractors: optimal up to constant factors.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors.
Proceedings of the Advances in Cryptology, 2002

On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives.
Proceedings of the Advances in Cryptology, 2002

2001
A Note on Iterating an alpha-ary Gray Code.
SIAM J. Discrete Math., 2001

New Algorithmic Aspects of the Local Lemma with Applications to Routing and Partitioning.
SIAM J. Comput., 2001

Efficient Algorithms for Two Generalized 2-Median Problems on Trees.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Oblivious Polynomial Evaluation and Oblivious Neural Learning.
Proceedings of the Advances in Cryptology, 2001

2000
Derandomizing Arthur-Merlin Games under Uniform Assumptions.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
A Deterministic Approximation Algorithm for a Minmax Integer Programming Problem.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

On Monotone Planar Circuits.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1998
Searching Constant Width Mazes Captures the AC0 Hierarchy.
Proceedings of the STACS 98, 1998

Deterministic Hypergraph Coloring and Its Applications.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Improved Pseudorandom Generators for Combinatorial Rectangles.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

An Exact Characterization of Symmetric Functions in qAC0[2].
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Searching constant width mazes captures the AC0 hierarchy
Electronic Colloquium on Computational Complexity (ECCC), 1997

1992
On the Parallel Computation of the Algebraic Path Problem.
IEEE Trans. Parallel Distrib. Syst., 1992

1990
Constant Time Algorithms for the Transitive Closure Problem and Its Applications.
Proceedings of the 1990 International Conference on Parallel Processing, 1990


  Loading...