: Modelling dynamic programming problems by generalized d-graphs.
Pascal O. Vontobel
: Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function.
: Kolmogorov-Loveland Sets and Advice Complexity Classes.
: An Algorithm for the Graph Crossing Number Problem.
L. F. Johnson
: Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers.
, Loet Leydesdorff
: Fractional counting of citations in research evaluation: An option for cross- and interdisciplinary assessments.
, Siming Wei
: A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms.
, Gennian Ge
: Supporting Information for the Paper: Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five, IEEE Trans. Inform. Theory, To Appear.
, Pramod Viswanath
: Compress-and-Forward Scheme for a Relay Network: Approximate Optimality and Connection to Algebraic Flows.
, Dirk T. M. Slock
: Average Minimum Transmit Power to achieve SINR Targets: Performance Comparison of Various User Selection Algorithms.
, Thomas Bühler
: An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA.
: Application of the EWL protocol to decision problems with imperfect recall.
: Interactive proofs with competing teams of no-signaling provers.
: Using ASP with recent extensions for causal explanations.
Ioannis K. Paparrizos
: A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm.
, Yann Ponty
: Weighted random generation of context-free languages: Analysis of collisions in random urn occupancy models.
: Representations of task assignments in distributed systems using Young tableaux and symmetric groups.
A. Karim Abu-Affash
: An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem.
: A Unified Analysis of Transmission with Transceiver Distortion and Some Applications.
: Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework.
Daniel M. Kane
: k-Independent Gaussians Fool Polynomial Threshold Functions.
: A study on the relation between linguistics-oriented and domain-specific semantics.
: A Generalized Streaming Model for Concurrent Computing.