The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- An approach to measure the robustness of fuzzy reasoning (Q3022766) (← links)
- Categorization of Neural Excitability Using Threshold Models (Q3025064) (← links)
- Asymptotic Theory of Information-Theoretic Experimental Design (Q3025067) (← links)
- Spike Timing Precision and Neural Error Correction: Local Behavior (Q3025071) (← links)
- Director Strings Revisited: A Generic Approach to the Efficient Representation of Free Variables in Higher-order Rewriting (Q3025334) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- Streaking in median filtered images (Q3028840) (← links)
- Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete (Q3029023) (← links)
- A Queueing Analysis of Hashing with Lazy Deletion (Q3029974) (← links)
- The forwarding index of communication networks (Q3030727) (← links)
- An Axiomatic Approach to Proportionality Between Matrices (Q3031102) (← links)
- The solution of some random NP-hard problems in polynomial expected time (Q3031922) (← links)
- Maximum matchings in general graphs through randomization (Q3031945) (← links)
- On the Limit Sets of Cellular Automata (Q3033336) (← links)
- Authenticated Algorithms for Byzantine Agreement (Q3036697) (← links)
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected (Q3036719) (← links)
- Knots and links in spatial graphs (Q3037464) (← links)
- Multidimensional Sorting (Q3038629) (← links)
- On improving the worst case running time of the Boyer-Moore string matching algorithm (Q3048242) (← links)
- Applications of Path Compression on Balanced Trees (Q3048273) (← links)
- An optimal insertion algorithm for one-sided height-balanced binary search trees (Q3048275) (← links)
- Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes (Q3048616) (← links)
- How to share a secret (Q3050283) (← links)
- Deblurring of One Dimensional Bar Codes via Total Variation Energy Minimization (Q3052946) (← links)
- Stochastic Neural Field Theory and the System-Size Expansion (Q3053166) (← links)
- Joint Multichannel Blind Speech Separation and Dereverberation: A Real-Time Algorithmic Implementation (Q3053340) (← links)
- New Tools for Expression Alternative Splicing Validation (Q3053363) (← links)
- A Novel Tool for Assisted In-silico Cloning and Sequence Editing in Molecular Biology (Q3053369) (← links)
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems (Q3055065) (← links)
- A new prime $p$ for which the least primitive root $({\rm mod} p)$ and the least primitive root $({\rm mod} p^2)$ are not equal (Q3055139) (← links)
- Ten new primitive binary trinomials (Q3055140) (← links)
- Proportionally modular diophantine inequalities and the Stern-Brocot tree (Q3055142) (← links)
- New sums of three cubes (Q3055143) (← links)
- Nitsche’s method for general boundary conditions (Q3055149) (← links)
- Solution of $F(z+1)=\exp \big (F(z)\big )$ in complex $z$-plane (Q3055164) (← links)
- Hierarchical Cellular Automata Methods (Q3055547) (← links)
- Aggregation Operators for Evaluating Alternatives (Q3055566) (← links)
- Fuzzy Linear Programming in Practice: An Application to the Spanish Football League (Q3055588) (← links)
- Coloring uniform hypergraphs with few edges (Q3055779) (← links)
- Nominals, Inverses, Counting, and Conjunctive Queries or: Why Infinity is your Friend! (Q3055811) (← links)
- Kalman Temporal Differences (Q3055813) (← links)
- On the minimum degree of minimal Ramsey graphs (Q3055912) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- Achromatic number of fragmentable graphs (Q3055929) (← links)
- On the complexity of distributed graph coloring with local minimality constraints (Q3057099) (← links)
- The regenerator location problem (Q3057148) (← links)
- Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation (Q3057149) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Mixed search number and linear-width of interval and split graphs (Q3057182) (← links)
- Probability of Repeating Patterns in Simultaneous Neural Data (Q3057203) (← links)
