The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Transformation and Debugging of Functional Logic Programs (Q3578400) (← links)
- Evolutionary Algorithms for Planar MEMS Design Optimisation: A Comparative Study (Q3578831) (← links)
- Nonlinear Waves: An Introduction (Q3579158) (← links)
- Tight security proofs for the bounded-storage model (Q3579184) (← links)
- Relations between average case complexity and approximation complexity (Q3579211) (← links)
- Similarity estimation techniques from rounding algorithms (Q3579235) (← links)
- SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS (Q3579255) (← links)
- BIFURCATION ANALYSIS OF A CIRCUIT-RELATED GENERALIZATION OF THE SHIPMAP (Q3579277) (← links)
- Sparse and Redundant Representations (Q3579819) (← links)
- MANY-VALUED MODAL LOGICS: A SIMPLE APPROACH (Q3580668) (← links)
- Visibly pushdown languages (Q3580970) (← links)
- Batch codes and their applications (Q3580973) (← links)
- Sensitivity Analysis for Oscillating Dynamical Systems (Q3581064) (← links)
- Exact Bounds for Linear Outputs of the Advection-Diffusion-Reaction Equation Using Flux-Free Error Estimates (Q3581081) (← links)
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement (Q3581264) (← links)
- Adiabatic quantum state generation and statistical zero knowledge (Q3581286) (← links)
- Approximately counting integral flows and cell-bounded contingency tables (Q3581402) (← links)
- A concise guide to the Traveling Salesman Problem (Q3582631) (← links)
- A profile of OR research and practice published in the <i>Journal of the Operational Research Society</i> (Q3582636) (← links)
- A dispatching algorithm for parallel machines with rework processes (Q3582643) (← links)
- The Challenges of Multivalued “Functions” (Q3582691) (← links)
- Mechanized Mathematics (Q3582704) (← links)
- Symbolic Domain Decomposition (Q3582706) (← links)
- Dimensions of Formality: A Case Study for MKM in Software Engineering (Q3582721) (← links)
- Towards MKM in the Large: Modular Representation and Scalable Software Architecture (Q3582723) (← links)
- Factorization of a 768-Bit RSA Modulus (Q3582763) (← links)
- Universally Composable Incoercibility (Q3582767) (← links)
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs (Q3583310) (← links)
- Algebraic Side-Channel Analysis in the Presence of Errors (Q3583480) (← links)
- A Spiking Neuron as Information Bottleneck (Q3583485) (← links)
- A Computationally Efficient Method for Nonparametric Modeling of Neural Spiking Activity with Point Processes (Q3583488) (← links)
- Reconciling the STDP and BCM Models of Synaptic Plasticity in a Spiking Recurrent Neural Network (Q3583495) (← links)
- Multilayer Processing of Spatiotemporal Spike Patterns in a Neuron with Active Dendrites (Q3583497) (← links)
- Competitive Layer Model of Discrete-Time Recurrent Neural Networks with LT Neurons (Q3583499) (← links)
- Modeling Stereopsis via Markov Random Field (Q3583501) (← links)
- Why Don't We Decipher an Outdated Cipher System? The Codex of Rohonc (Q3583508) (← links)
- Polynomial-time data reduction for dominating set (Q3583575) (← links)
- Smoothed analysis of algorithms (Q3583576) (← links)
- On Existence and Approximation for a 3D Model of Thermally Induced Phase Transformations in Shape-Memory Alloys (Q3584119) (← links)
- Two-Way Unary Automata versus Logarithmic Space (Q3584893) (← links)
- Mediated Traceable Anonymous Encryption (Q3584974) (← links)
- How Leaky Is an Extractor? (Q3584989) (← links)
- ALLOSTATIC CONTROL FOR ROBOT BEHAVIOR REGULATION: A COMPARATIVE RODENT-ROBOT STUDY (Q3585126) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- Decidability properties for fragments of CHR (Q3585171) (← links)
- Logic–based decision support for strategic environmental assessment (Q3585174) (← links)
- CLP-based protein fragment assembly (Q3585180) (← links)
- A heuristic approach for the truck and trailer routing problem (Q3585726) (← links)
- On Complete Problems, Relativizations and Logics for Complexity Classes (Q3586004) (← links)
- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model (Q3586090) (← links)
