yusuke1997/dblp-id-title huggingface dataset:
The Big Deal: Applying Constraint Satisfaction Technologies Where It Makes the Difference
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers
Cooking String-Integer Conversions with Noodles
Towards Learning Quantifier Instantiation in SMT
Designing an Efficient Hardware Implication Accelerator for SAT Solving
Proof Complexity of Fragments of Long-Distance Q-Resolution
On Freezing and Reactivating Learnt Clauses
Machine Learning-Based Restart Policy for CDCL SAT Solvers
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
Local Search with Bootstrapping
SAT Solving for Termination Analysis with Polynomial Interpretations
Learning Polynomials over GF(2) in a SAT Solver - (Poster Presentation)
Exploiting the Power of mip Solvers in maxsat
Towards a Complexity-Theoretic Understanding of Restarts in SAT Solvers
The Complexity of Reasoning for Fragments of Default Logic
Quantum Graph-State Synthesis with SAT
Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems
On Tackling the Limits of Resolution in SAT Solving
Density Condensation of Boolean Formulas
Finding Lean Induced Cycles in Binary Hypercubes
Global Benchmark Database
Probabilistic Model Counting with Short XORs
A SAT Approach to Clique-Width
Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT
Minimally Unsatisfiable Boolean Circuits
Bridging Language Models and Symbolic Solvers via the Model Context Protocol
Analyzing Reformulation Performance in Core-Guided MaxSAT Solving
Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings
Attacking Bivium Using SAT Solvers
Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings
Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
New Results on the Phase Transition for Random Quantified Boolean Formulas
A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs
Finding Efficient Circuits Using SAT-Solvers
CryptoMiniSat Switches-Optimization for Solving Cryptographic Instances
Horn Upper Bounds and Renaming
On Solving the Partial MAX-SAT Problem
SATLab: X-Raying Random k-SAT - (Tool Presentation)
Trusted Scalable SAT Solving with On-The-Fly LRAT Checking
Efficiently Calculating Evolutionary Tree Measures Using SAT
CNFgen: A Generator of Crafted Benchmarks
A Modular Approach to MaxSAT Modulo Theories
Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization
A Lightweight Component Caching Scheme for Satisfiability Solvers
Checking Unsatisfiability Proofs in Parallel
PaInleSS: A Framework for Parallel SAT Solving
Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle
Symbolic Techniques in Propositional Satisfiability Solving
Entailing Generalization Boosts Enumeration
Survey and Belief Propagation on Random K-SAT
Short XORs for Model Counting: From Theory to Practice
Comparing Different Prenexing Strategies for Quantified Boolean Formulas
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s 2 ) Time
Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Semi-Algebraic Proof Systems for QBF
XOR-Satisfiability Set Membership Filters
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
Circular (Yet Sound) Proofs
Quantified Maximum Satisfiability: - A Core-Guided Approach
On Limits of Symbolic Approach to SAT Solving
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
Symmetries of Quantified Boolean Formulas
An Exponential Lower Bound for Width-Restricted Clause Learning
Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
A First Step Towards a Unified Proof Checker for QBF
Complexity Results for Linear XSAT-Problems
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity
A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints
Introducing Intel(R) SAT Solver
Investigating the Existence of Costas Latin Squares via Satisfiability Testing
Captain Jack: New Variable Selection Heuristics in Local Search for SAT
A Progressive Simplifier for Satisfiability Modulo Theories
Revisiting SATZilla Features in 2024
Incremental Determinization
Diversification and Determinism in Local Search for Satisfiability
Quantifier Elimination in Stochastic Boolean Satisfiability
Counting Models in Integer Domains
Local Backbones
Aligning CNF- and Equivalence-Reasoning
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming
Abstraction-Driven SAT-based Analysis of Security Protocols
Long Proofs of (Seemingly) Simple Formulas
HordeSat: A Massively Parallel Portfolio SAT Solver
The Strength of the Dominance Rule
Even Shorter Proofs Without New Variables
MCP: Capturing Big Data by Satisfiability (Tool Description)
Fast and Flexible Difference Constraint Propagation for DPLL(T)
A CNF Class Generalizing Exact Linear Formulas
Failed Literal Detection for QBF
Substitutional Definition of Satisfiability in Classical Propositional Logic
POS-13. Fourth Pragmatics of SAT workshop, a workshop of the SAT 2013 conference, July 7, 2013, Helsinki, Finland
Extreme Cases in SAT Problems
BDDs for Pseudo-Boolean Constraints - Revisited
SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints
Bounds on Threshold of Regular Random k -SAT
Projection Heuristics for Binary Branchings Between Sum and Product
Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
The MergeSat Solver
The Ninth QBF Solvers Evaluation - Preliminary Report
Certified CNF Translations for Pseudo-Boolean Solving
Faster Extraction of High-Level Minimal Unsatisfiable Cores
Partial Max-SAT Solvers with Clause Learning
Solving Error Correction for Large Data Sets by Means of a SAT Solver
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs
Full CNF Encoding: The Counting Constraints Case
Local Search on SAT-encoded Colouring Problems
Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability
A Proof Builder for Max-SAT
Exponential Separations in a Hierarchy of Clause Learning Proof Systems
Solving #SAT Using Vertex Covers
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology
Dependency Schemes for DQBF
SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox - (Tool Presentation)
Recovering and Utilizing Partial Duality in QBF
Clause Size Reduction with all-UIP Learning
Boundary Points and Resolution
SAT-Based Leximax Optimisation Algorithms
Concolic Testing and Constraint Satisfaction
#∃SAT: Projected Model Counting
Distributed Cube and Conquer with Paracooba
Cardinality Networks and Their Applications
Polynomial-Time Validation of QCDCL Certificates
Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings
Improving Implementation of SAT Competitions 2017-2019 Winners
Exploiting Treewidth for Projected Model Counting and Its Limits
Quantifier Trees for QBFs
Fine-Grained Complexity Analysis of Dependency Quantified Boolean Formulas
Improving Unsatisfiability-Based Algorithms for Boolean Optimization
OpenSMT2: An SMT Solver for Multi-core and Cloud Computing
Certified Knowledge Compilation with Application to Verified Model Counting
Proceedings of the 14th International Workshop on Pragmatics of SAT co-located with the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), Alghero, Italy, July 4, 2023
Relating Existing Powerful Proof Systems for QBF
Long Distance Q-Resolution with Dependency Schemes
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract
MaxPre: An Extended MaxSAT Preprocessor
Fault Localization and Correction with QBF
Unified Characterisations of Resolution Hardness Measures
Speeding up the Constraint-Based Method in Difference Logic
A SAT Approach to Branchwidth
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization
How Good Can a Resolution Based SAT-solver Be?
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving
Dependency Learning for QBF
Towards a Better Understanding of (Partial Weighted) MaxSAT Proof Systems
Small Unsatisfiable k-CNFs with Bounded Literal Occurrence
Average-Case Analysis for the MAX-2SAT Problem
Uniquely Satisfiable k -SAT Instances with Almost Minimal Occurrences of Each Variable
Binary Clause Reasoning in QBF
Statistical Methodology for Comparison of SAT Solvers
NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances
A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers
Better Extension Variables in DQBF via Independence
POS-14. Fifth Pragmatics of SAT workshop, a workshop of the SAT 2014 conference, part of FLoC 2014 during the Vienna Summer of Logic, July 13, 2014, Vienna, Austria
Verifying Propositional Unsatisfiability: Pitfalls to Avoid
Learning Back-Clauses in SAT - (Poster Presentation)
MUStICCa: MUS Extraction with Interactive Choice of Candidates
Minimum Witnesses for Unsatisfiable 2CNFs
Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings
On Q-Resolution and CDCL QBF Solving
Using Community Structure to Detect Relevant Learnt Clauses
QBF as an Alternative to Courcelle's Theorem
Circuit Based Encoding of CNF Formula
Mycielski Graphs and PR Proofs
Looking Algebraically at Tractable Quantified Boolean Formulas
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Concurrent Clause Strengthening
DRAT Proofs, Propagation Redundancy, and Extended Resolution
Ultimately Incremental SAT
MaxSAT Resolution with Inclusion Redundancy
Formalizing Dangerous SAT Encodings
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
MaxSAT Resolution and Subcube Sums
Restart Strategy Selection Using Machine Learning Techniques
Benchmarking SAT Solvers for Bounded Model Checking
Validation of QBF Encodings with Winning Strategies
Regular and General Resolution: An Improved Separation
QCDCL vs QBF Resolution: Further Insights
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths
Certifying Projected Knowledge Compilation
Lower Bounds for QCDCL via Formula Gauge
Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings
Sums of Squares, Satisfiability and Maximum Satisfiability
A SAT Attack on the Erdős Discrepancy Conjecture
Local Soundness for QBF Calculi
Off the Trail: Re-examining the CDCL Algorithm
Watched Data Structures for QBF Solvers
Aligning CNF- and Equivalence-reasoning
Adaptive Restart Strategies for Conflict Driven SAT Solvers
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
Simplified and Improved Separations Between Regular and General Resolution by Lifting
Algorithms for Variable-Weighted 2-SAT and Dual Problems
SAT-Encodings for Special Treewidth and Pathwidth
MaxSAT-Based Bi-Objective Boolean Optimization
Polynomial Time SAT Decision for Complementation-Invariant Clause-Sets, and Sign-non-Singular Matrices
Analysis of Core-Guided MaxSat Using Cores and Correction Sets
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT
Polynomial Calculus for MaxSAT
Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings
New Lower Bounds for Polynomial Calculus over Non-Boolean Bases
Nested Boolean Functions as Models for Quantified Boolean Formulas
Enhanced Gaussian Elimination in DPLL-based SAT Solvers
There Are No CNF Problems
Simplifying CDCL Clause Database Reduction
PySAT: A Python Toolkit for Prototyping with SAT Oracles
Improving MCS Enumeration via Caching
Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers
Q-Resolution with Generalized Axioms
Streamlining Distributed SAT Solver Design
Limits of CDCL Learning via Merge Resolution
EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation
Evaluating CDCL Restart Schemes
SAT-Based Horn Least Upper Bounds
Equivalence Models for Quantified Boolean Formulas
Recognition of Nested Gates in CNF Formulas
Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer
Scheduling Reach Mahjong Tournaments Using Pseudoboolean Constraints
Efficient Certified Reasoning for Binarized Neural Networks
Improvements to Hybrid Incremental SAT Algorithms
A (Biased) Proof Complexity Survey for SAT Practitioners
Minimising Deterministic Büchi Automata Precisely Using SAT Solving
Model-Equivalent Reductions
π DD: A New Decision Diagram for Efficient Problem Solving in Permutation Space
On Subsumption Removal and On-the-Fly CNF Simplification
Models and Counter-Models of Quantified Boolean Formulas (Invited Talk)
XOR Local Search for Boolean Brent Equations
Improved Exact Solvers for Weighted Max-SAT
Breaking Symmetries in SAT Matrix Models
Computing Maximum Unavoidable Subgraphs Using SAT Solvers
On Simplification of Formulas with Unconstrained Variables and Quantifiers
An Algorithm for SAT Above the Threshold
Parameterized Complexity of Weighted Satisfiability Problems
Modelling Max-CSP as Partial Max-SAT
Upper and Lower Bounds for Weak Backdoor Set Detection
Approximation Algorithm for Random MAX-kSAT
Minimum 2CNF Resolution Refutations in Polynomial Time
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT
An Empirical Study of the Effect of Learnt Clause on the Structural Measures of SAT problems
Improved Local Search for Circuit Satisfiability
Solving Huge Instances with Intel(R) SAT Solver
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs
Short Q-Resolution Proofs with Homomorphisms
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
Effective Incorporation of Double Look-Ahead Procedures
A Generalization of the Satisfiability Coding Lemma and Its Applications
QBF Resolution Systems and Their Proof Complexities
Transformations into Normal Forms for Quantified Circuits
Learn to Unlearn
A System for Solving Constraint Satisfaction Problems with SMT
CSPs: Adding Structure to SAT
Applications of MaxSAT in Data Analysis
Variable Influences in Conjunctive Normal Forms
Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling
Coverage-Based Clause Reduction Heuristics for CDCL Solvers
Enhancing State-of-the-Art Parallel SAT Solvers Through Optimized Sharing Policies
Logical Algorithmics: From Relational Queries to Boolean Reasoning (Invited Talk)
On the Effect of Learned Clauses on Stochastic Local Search
Shortening QBF Proofs with Dependency Schemes
Designing New Phase Selection Heuristics
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions
Satisfiability Threshold of the Skewed Random k -SAT
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
Open-WBO: A Modular MaxSAT Solver,
Clausal Abstraction for DQBF
A Distributed Version of Syrup
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning
On the Hierarchical Community Structure of Practical Boolean Formulas
Bounds on BDD-Based Bucket Elimination
Short Proofs in QBF Expansion
A Generalized Framework for Conflict Analysis
HordeQBF: A Modular and Massively Parallel QBF Solver
Parallel MUS Extraction
Scalable Precise Computation of Shannon Entropy
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings
Clausal Congruence Closure
Backing Backtracking
QRAT Polynomially Simulates ∀ \text -Exp+Res
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables
Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems
SAT Solving with Reference Points
Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers
A SAT Attack on Rota's Basis Conjecture
Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation)
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver
AllSAT for Combinational Circuits
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms
Syntax-Guided Rewrite Rule Enumeration for SMT Solvers
Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems
A Clause-Based Heuristic for SAT Solvers
Random Local Access for Sampling k-SAT Solutions
Cliquewidth and Knowledge Compilation
DiMo - Discrete Modelling Using Propositional Logic
Matched Formulas and Backdoor Sets
Boolean Ring Satisfiability
Input Distance and Lower Bounds for Propositional Resolution Proof Length
Conflict-Based Selection of Branching Rules
Solving MaxSAT with Bit-Vector Optimization
Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems
Parallel Clause Sharing Strategy Based on Graph Structure of SAT Problem
An Extensible SAT-solver
Conflict-Driven XOR-Clause Learning
Reconstructing Solutions after Blocked Clause Elimination
Strategy Extraction by Interpolation
Search vs. Symbolic Techniques in Satisfiability Solving
The Second QBF Solvers Comparative Evaluation
The Packing Chromatic Number of the Infinite Square Grid Is at Least 14
QBFFam: A Tool for Generating QBF Families from Proof Complexity
A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories
Improved Exact Solver for the Weighted MAX-SAT Problem
Improvements to Core-Guided Binary Search for MaxSAT
On SAT Modulo Theories and Optimization Problems
CNFs and DNFs with Exactly k Solutions
Intensification Search in Modern SAT Solvers - (Poster Presentation)
Analyzing the Instances of the MaxSAT Evaluation
DPvis - A Tool to Visualize the Structure of SAT Instances
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas
Hints Revealed
Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
Incremental Inprocessing in SAT Solving
UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques
Finding All Minimal Safe Inductive Sets
Formula partitioning revisited
Heuristics for Fast Exact Model Counting
A Case for Efficient Solution Enumeration
Variable Dependencies and Q-Resolution
Reproducible Efficient Parallel SAT Solving
The Equivalences of Refutational QRAT
Proofs for Propositional Model Counting
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
Antichain with SAT and Tries
Hardness and Optimality in QBF Proof Systems Modulo NP
A Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation)
Revisiting Graph Width Measures for CNF-Encodings
Chronological Backtracking
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms
Lifting QBF Resolution Calculi to DQBF
An Algebraic Approach to MaxCSP
Circuit-Based Search Space Pruning in QBF
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
IPASIR-UP: User Propagators for CDCL
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT
On Dedicated CDCL Strategies for PB Solvers
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses
Encoding Treewidth into SAT
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution
Proof Complexity of Propositional Default Logic
SBSAT: a State-Based, BDD-Based Satisfiability Solver
A Compact and Efficient SAT-Encoding of Finite Domain CSP
Effective Preprocessing in SAT Through Variable and Clause Elimination
The SAT Museum
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations
Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings
Mapping CSP into Many-Valued SAT
Algorithms for Satisfiability using Independent Sets of Variables
Tuning Parallel SAT Solvers
(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas
Problem-Sensitive Restart Heuristics for the DPLL Procedure
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
A Decision-Making Procedure for Resolution-Based SAT-Solvers
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas
CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers - (Tool Presentation)
Incremental QBF Preprocessing for Partial Design Verification - (Poster Presentation)
Speeding up Pseudo-Boolean Propagation
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), Bordeaux, France, July 4, 2016
Improving First-order Model Searching by Propositional Reasoning and Lemma Learning
IRVO: an Architectural Model for Collaborative Interaction in Mixed Reality Environments
MIXER '04, Exploring the Design and Engineering of Mixed Reality Systems, Proceedings of the IUI-CADUI*04 Workshop on Exploring the Design and Engineering of Mixed Reality Systems, Funchal, Island of Madeira, Portugal, January 13th, 2004
Design Patterns for Augmented Reality Systems
A Mixed Reality System for Design Engineering: Thinking, Issues and Solutions
Towards a Development Methodology for Augmented Reality User Interfaces
Obstacles and Perspectives for Evaluating Mixed Reality Usability
Unit: Modular Development of Distributed Interaction Techniques for Highly Interactive User Interfaces
Generic Interaction Techniques For Mobile Collaborative Mixed Reality Systems
Designing augmented interfaces for guided tours using multimedia sketches
FixIt: An Approach towards Assisting Workers in Diagnosing Machine Malfunctions
Designing Interaction Space for Mixed Reality Systems
Abstract and Concrete Interaction with Mixed Reality Systems / The case of the mini screen, a new interaction device in Computer-Assisted Surgery
Proceedings of the 10th International Workshop on Serverless Computing, WoSC 2024, Hong Kong, SAR, China, December 2-6, 2024
Proceedings of the Eighth International Workshop on Serverless Computing, WoSC 2022, Quebec City, QC, Canada, 7 November 2022
Sentinel: a fast and memory-efficient serverless architecture for lightweight applications
Forklift: Fitting Zygote Trees for Faster Package Initialization
ProFaaStinate: Delaying Serverless Function Calls to Optimize Platform Performance
All-you-can-inference: serverless DNN model inference suite
Proceedings of the 9th International Workshop on Serverless Computing, WoSC 2023, Bologna, Italy, December 11-15, 2023
GraphQL vs. REST: A Performance and Cost Investigation for Serverless Applications
On Serving Image Classification Models
Efficiently Detecting Performance Changes in FaaS Application Releases
GreenCourier: Carbon-Aware Scheduling for Serverless Functions
Energy-Aware Scheduling of a Serverless Workload in an ISA-Heterogeneous Cluster