Baiyu Li

Orcid: 0000-0003-1088-9328

According to our database1, Baiyu Li authored at least 37 papers between 2010 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses.
IEEE Robotics Autom. Lett., June, 2023

Hintless Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch., 2023

Double-Deck Multi-Agent Pickup and Delivery: Multi-Robot Rearrangement in Large-Scale Warehouses.
CoRR, 2023

2022
Optimal Order of Time-Domain Adaptive Filter for Anti-Jamming Navigation Receiver.
Remote. Sens., 2022

Distortionless 1/2 Overlap Windowing in Frequency Domain Anti-Jamming of Satellite Navigation Receivers.
Remote. Sens., 2022

Sidelobes Suppression for Time Domain Anti-Jamming of Satellite Navigation Receivers.
Remote. Sens., 2022

Suppression of Jammer Multipath in GNSS Antenna Array Receiver.
Remote. Sens., 2022

Research on Detection Technology of Spoofing under the Mixed Narrowband and Spoofing Interference.
Remote. Sens., 2022

Securing Approximate Homomorphic Encryption Using Differential Privacy.
IACR Cryptol. ePrint Arch., 2022

ACORN: Input Validation for Secure Aggregation.
IACR Cryptol. ePrint Arch., 2022

Impact of Antenna Polarization Mismatch on High-precision GNSS Application.
Proceedings of the icWCSN 2022: 9th international Conference on Wireless Communication and Sensor Networks, Dalian, China, January 11, 2022

2020
Computational and Symbolic Models for Secure Computation.
PhD thesis, 2020

Unbiased Interference Suppression Method Based on Spectrum Compensation.
IEICE Trans. Commun., 2020

On the Security of Homomorphic Encryption on Approximate Numbers.
IACR Cryptol. ePrint Arch., 2020

TinyGarble2: Smart, Efficient, and Scalable Yao's Garble Circuit.
IACR Cryptol. ePrint Arch., 2020

Gadget-Based iNTRU Lattice Trapdoors.
IACR Cryptol. ePrint Arch., 2020

2019
Semi-parallel Logistic Regression for GWAS on Encrypted Data.
IACR Cryptol. ePrint Arch., 2019

Homomorphic Encryption for Finite Automata.
IACR Cryptol. ePrint Arch., 2019

Acceleration Method for Software Signal Simulators of BDS Navigation Signals and RDSS Signals Based on GPGPU.
IEEE Access, 2019

2018
Symbolic security of garbled circuits.
IACR Cryptol. ePrint Arch., 2018

High-Efficiency Broadband Remote RF Signal Down-Conversion Based on Sideband Optical Phase-Locked Loop.
Proceedings of the European Conference on Optical Communication, 2018

2016
Equational Security Proofs of Oblivious Transfer Protocols.
IACR Cryptol. ePrint Arch., 2016

Compactness vs Collusion Resistance in Functional Encryption.
IACR Cryptol. ePrint Arch., 2016

2015
Unambiguous s-curve shaping for multipath mitigation for MBOC modulated signals in GNSS.
Proceedings of the International Conference on Wireless Communications & Signal Processing, 2015

2014
Syntactic Complexity of ℛ- and 풥-Trivial Regular Languages.
Int. J. Found. Comput. Sci., 2014

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages.
Acta Cybern., 2014

2013
Quotient complexity of ideal languages.
Theor. Comput. Sci., 2013

Syntactic Complexity of - and -Trivial Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages.
Theor. Comput. Sci., 2012

Syntactic Complexities of Six Classes of Star-Free Languages.
J. Autom. Lang. Comb., 2012

Syntactic Complexity of R- and J-Trivial Regular Languages
CoRR, 2012

Syntactic Complexities of Some Classes of Star-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

SkypeMorph: protocol obfuscation for Tor bridges.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Syntactic Complexity of Star-Free Languages
CoRR, 2011

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Languages
CoRR, 2011

Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010
On the Complexity of the Evaluation of Transient Extensions of Boolean Functions
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010


  Loading...