_id,doi,title
12171,10.1007/978-3-031-19992-9_22,"Synthesis of parametric hybrid automata from time series"
12175,10.1007/978-3-031-19135-0_5,History-deterministic timed automata are not determinizable
12176,10.1007/978-3-031-15979-4_13,"Practical statistically-sound proofs of exponentiation in any group"
12298,10.1007/978-3-031-18283-9_14,"Jolteon and ditto: Network-adaptive efficient consensus with asynchronous fallback"
12302,10.1007/978-3-031-13188-2_6,FORQ-based language inclusion formal testing
12516,10.1007/978-3-031-22365-5_20,"Public-Key Encryption from Homogeneous CLWE"
11771,10.1007/978-3-030-83508-8_34,Upper and lower bounds for fully retroactive graph problems
9210,10.1007/978-3-030-71278-5_18,Does SGD implicitly optimize for smoothness?
9227,10.1007/978-3-030-67899-9_28,Experimental evaluation of a local search approximation algorithm for the multiway cut problem
9620,10.1007/978-3-030-79527-6_1,Collecting coupons is faster with friends
10041,10.1007/978-3-030-84245-1_17,"Limits on the Adaptive Security of Yao’s Garbling"
10076,10.1007/978-3-662-63958-0_34,Reactive key-loss protection in blockchains
10108,10.1007/978-3-030-88494-9_12,Differential monitoring
10206,10.1007/978-3-030-88494-9_3,"Into the unknown: active monitoring of neural networks"
10324,10.1007/978-3-662-64331-0_11,Brick: Asynchronous incentive-compatible payment channels
10325,10.1007/978-3-662-64331-0_1,SoK: Communication across distributed ledgers
10407,10.1007/978-3-030-90453-1_14,Trojan-resilience without cryptography
10408,10.1007/978-3-030-90456-2_8,Grafting key trees: Efficient key management for overlapping groups
10409,10.1007/978-3-030-90453-1_17,"On treewidth, separators and Yao’s garbling"
10410,10.1007/978-3-030-90453-1_19,The cost of adaptivity in security games on graphs