BibSLEIGH — complex stem

Used together with:

system (209)
model (174)
comput (116)
base (114)
queri (107)

Stem complex$ (all stems)

1982 papers:

CASE-2015-FeiAR #bound #clustering #resource management #symbolic computation #using: Symbolic computation of boundary unsafe states in complex resource allocation systems using partitioning techniques (ZF, KÅ, SAR), pp. 799–806.
CASE-2015-WuJG #complexity #optimisation: Local and global event-based optimization: Performace and complexity (ZW, QSJ, XG), pp. 1375–1380.
DAC-2015-SuC #complexity: Nanowire-aware routing considering high cut mask complexity (YHS, YWC), p. 6.
DATE-2015-MirkhaniMCA #design #estimation #fault #performance: Efficient soft error vulnerability estimation of complex designs (SM, SM, CYC, JA), pp. 103–108.
DATE-2015-NguyenASS #gpu #simulation: Accelerating complex brain-model simulations on GPU platforms (HADN, ZAA, GS, CS), pp. 974–979.
DATE-2015-RaiT #manycore #modelling: A calibration based thermal modeling technique for complex multicore systems (DR, LT), pp. 1138–1143.
DATE-2015-WartelKGBSTQLMB #analysis #case study #hardware: Timing analysis of an avionics case study on complex hardware/software platforms (FW, LK, AG, AB, ZRS, BT, EQ, CL, EM, IB, JA, LCG, TV, FJC), pp. 397–402.
PODS-2015-FaginKK #complexity: Dichotomies in the Complexity of Preferred Repairs (RF, BK, PGK), pp. 3–15.
PODS-2015-GuchtWWZ #communication #complexity #distributed #matrix #multi: The Communication Complexity of Distributed Set-Joins with Applications to Matrix Multiplication (DVG, RW, DPW, QZ), pp. 199–212.
PODS-2015-Kapralov #complexity #nearest neighbour #query #trade-off: Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search (MK), pp. 329–342.
PODS-2015-KoutrisW #complexity #consistency #constraints #query #self: The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints (PK, JW), pp. 17–29.
SIGMOD-2015-ScheibliDB #3d #distributed #interactive #named #query #visualisation: QE3D: Interactive Visualization and Exploration of Complex, Distributed Query Plans (DS, CD, AB), pp. 877–881.
VLDB-2015-HaasAGM #crowdsourcing #named: Argonaut: Macrotask Crowdsourcing for Complex Data Processing (DH, JA, LG, AM), pp. 1642–1653.
ESOP-2015-CicekGA #complexity #incremental #refinement: Refinement Types for Incremental Computational Complexity (EÇ, DG, UAA), pp. 406–431.
MSR-2015-PonzanelliML #development #mining #semistructured data: Summarizing Complex Development Artifacts by Mining Heterogeneous Data (LP, AM, ML), pp. 401–405.
STOC-2015-AbrahamD #complexity #polynomial: Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (IA, DD), pp. 605–614.
STOC-2015-AlwenS #complexity #graph #parallel: High Parallel Complexity Graphs and Memory-Hard Functions (JA, VS), pp. 595–603.
STOC-2015-ChenDO #complexity #game studies #nash #on the: On the Complexity of Nash Equilibria in Anonymous Games (XC, DD, AO), pp. 381–390.
STOC-2015-FearnleyS #complexity: The Complexity of the Simplex Method (JF, RS), pp. 201–208.
STOC-2015-FeldmanPV #complexity #on the #problem #random #satisfiability: On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
STOC-2015-GowersV #communication #complexity: The communication complexity of interleaved group products (TG, EV), pp. 351–360.
STOC-2015-Touchette #complexity #quantum: Quantum Information Complexity (DT), pp. 317–326.
CIAA-J-2013-BalkanskiBKW15 #complexity #on the #word: On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
CIAA-2015-AdigaKMRRS #complexity: Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems (AA, CJK, MVM, SSR, DJR, RES), pp. 21–34.
CIAA-2015-FernauPS #automaton #complexity #finite: Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.
CIAA-2015-NgRS #complexity #distance: State Complexity of Prefix Distance (TN, DR, KS), pp. 238–249.
DLT-2015-AvgustinovichFP #complexity #infinity #permutation: Ergodic Infinite Permutations of Minimal Complexity (SVA, AEF, SP), pp. 71–84.
DLT-2015-BrandlS #analysis #automaton #complexity #finite #monad: Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.
DLT-2015-BrlekLP #complexity: Palindromic Complexity of Trees (SB, NL, XP), pp. 155–166.
DLT-2015-MasopustT #automaton #complexity #on the #testing: On the Complexity of k-Piecewise Testability and the Depth of Automata (TM, MT), pp. 364–376.
DLT-2015-NgRS #approximate #complexity #pattern matching: State Complexity of Neighbourhoods and Approximate Pattern Matching (TN, DR, KS), pp. 389–400.
DLT-2015-Yamakami #bound #complexity #quantum: Complexity Bounds of Constant-Space Quantum Computation — (Extended Abstract) (TY), pp. 426–438.
ICALP-v1-2015-AgrawalIKP #complexity #encoding #perspective #random #statistics: Statistical Randomized Encodings: A Complexity Theoretic View (SA, YI, DK, APC), pp. 1–13.
ICALP-v1-2015-BurtonMS #algorithm #complexity #invariant: Algorithms and Complexity for Turaev-Viro Invariants (BAB, CM, JS), pp. 281–293.
ICALP-v1-2015-Curticapean #complexity #framework: Block Interpolation: A Framework for Tight Exponential-Time Counting Complexity (RC), pp. 380–392.
ICALP-v1-2015-FontesJKLLR #communication #complexity: Relative Discrepancy Does not Separate Information and Communication Complexity (LF, RJ, IK, SL, ML, JR), pp. 506–516.
ICALP-v1-2015-GiannopoulouJLS #complexity #kernel: Uniform Kernelization Complexity of Hitting Forbidden Minors (ACG, BMPJ, DL, SS), pp. 629–641.
ICALP-v1-2015-KaniewskiLW #complexity #query: Query Complexity in Expectation (JK, TL, RdW), pp. 761–772.
ICALP-v1-2015-KannanM0 #complexity #graph #query: Near-Linear Query Complexity for Graph Inference (SK, CM, HZ), pp. 773–784.
ICALP-v1-2015-MolinaroWY #complexity: Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (MM, DPW, GY), pp. 960–972.
ICALP-v2-2015-Chatterjee0V #complexity #component #probability #synthesis: The Complexity of Synthesis from Probabilistic Components (KC, LD, MYV), pp. 108–120.
ICALP-v2-2015-SwernofskyW #complexity #on the: On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (JS, MW), pp. 414–426.
LATA-2015-AllenderM #complexity: Complexity of Regular Functions (EA, IM), pp. 449–460.
LATA-2015-BachmeierLS #automaton #complexity #finite: Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity (GB, ML, MS), pp. 473–485.
LATA-2015-BresolinMMSS #complexity #logic #on the: On the Complexity of Fragments of the Modal Logic of Allen’s Relations over Dense Structures (DB, DDM, AM, PS, GS), pp. 511–523.
LATA-2015-LuckMS #complexity #theorem: Parameterized Complexity of CTL — A Generalization of Courcelle’s Theorem (ML, AM, IS), pp. 549–560.
LATA-2015-MauriLMPZ #bibliography #complexity: Complexity Classes for Membrane Systems: A Survey (GM, AL, LM, AEP, CZ), pp. 56–69.
LATA-2015-VorelR #complexity #word: Complexity of Road Coloring with Prescribed Reset Words (VV, AR), pp. 161–172.
FM-2015-Damm #analysis #automation #lessons learnt #named #verification: AVACS: Automatic Verification and Analysis of Complex Systems Highlights and Lessons Learned (WD), pp. 18–19.
ICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order #source code: Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
CHI-2015-AmirGGSS #coordination: From Care Plans to Care Coordination: Opportunities for Computer Support of Teamwork in Complex Healthcare (OA, BJG, KZG, SMS, LMS), pp. 1419–1428.
CHI-2015-Noble #learning #self: Resilience Ex Machina: Learning a Complex Medical Device for Haemodialysis Self-Treatment (PJN), pp. 4147–4150.
CHI-2015-ZhongLBB #image #named: RegionSpeak: Quick Comprehensive Spatial Descriptions of Complex Images for Blind Users (YZ, WSL, ELB, JPB), pp. 2353–2362.
DUXU-UI-2015-Albers #communication: Infographics and Communicating Complex Information (MJA), pp. 267–276.
DUXU-UI-2015-AldawoodAAAAAHA #collaboration #interface: Collaborative Tangible Interface (CoTI) for Complex Decision Support Systems (SA, FA, AA, TA, TA, RA, MKH, AA, AAW), pp. 415–424.
HCI-DE-2015-Teixeira-FariaI #abstraction #complexity #component #interactive #visual notation: Reduce Complexity by Increasing Abstraction in Interactive Visual Components (PMTF, JRI), pp. 426–437.
HCI-IT-2015-BakaevA #complexity #human-computer #optimisation #user interface: Defining and Optimizing User Interfaces Information Complexity for AI Methods Application in HCI (MB, TA), pp. 397–405.
HCI-IT-2015-EskerudSOH #approach #automation #design #interface: Controlling the Home — A User Participatory Approach to Designing a Simple Interface for a Complex Home Automation System (ME, AS, CSO, HH), pp. 717–728.
HIMI-IKC-2015-RobertsACC #communication #complexity: A Method for Calculating Air Traffic Controller Communication Complexity (ZR, BA, JC, DC), pp. 25–32.
LCT-2015-ValdezBGSZ #complexity #visualisation #what: What Do My Colleagues Know? Dealing with Cognitive Complexity in Organizations Through Visualizations (ACV, SB, CG, US, MZ), pp. 449–459.
SCSM-2015-Kanawati #community #detection #network: Ensemble Selection for Community Detection in Complex Networks (RK), pp. 138–147.
CAiSE-2015-KhelladiHBRG #detection #evolution #metamodelling: Detecting Complex Changes During Metamodel Evolution (DEK, RH, RB, JR, MPG), pp. 263–278.
ICEIS-v1-2015-FolinoGP #behaviour #modelling #on the #process: On the Discovery of Explainable and Accurate Behavioral Models for Complex Lowly-structured Business Processes (FF, MG, LP), pp. 206–217.
ICEIS-v1-2015-Mocker #complexity #how: Complexity in the Digital Age — How can IT Help, not Hurt (MM), p. IX.
ICEIS-v2-2015-ThommazoCHGPBF #complexity #dependence #requirements #testing #using: Using the Dependence Level Among Requirements to Priorize the Regression Testing Set and Characterize the Complexity of Requirements Change (ADT, KC, EMH, GG, JP, AB, SF), pp. 231–241.
ECIR-2015-KoolenBBK #analysis #social #social media: Looking for Books in Social Media: An Analysis of Complex Search Requests (MK, TB, AvdB, JK), pp. 184–196.
ECIR-2015-YangLW #detection: Detecting the Eureka Effect in Complex Search (HY, JL, CW), pp. 734–740.
ICML-2015-ChangYXY #detection #semantics #using: Complex Event Detection using Semantic Saliency and Nearly-Isotonic SVM (XC, YY, EPX, YY), pp. 1348–1357.
ICML-2015-NarasimhanRS0 #algorithm #consistency #metric #multi #performance: Consistent Multiclass Algorithms for Complex Performance Measures (HN, HGR, AS, SA), pp. 2398–2407.
ICML-2015-ZhuG #complexity #robust #towards: Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing (RZ, QG), pp. 739–747.
KDD-2015-LanH #complexity #learning #multi: Reducing the Unlabeled Sample Complexity of Semi-Supervised Multi-View Learning (CL, JH), pp. 627–634.
KDD-2015-LucierOS #distributed #network #scalability: Influence at Scale: Distributed Computation of Complex Contagion in Networks (BL, JO, YS), pp. 735–744.
KDD-2015-UlanovaYCJKZ #performance #physics #profiling: Efficient Long-Term Degradation Profiling in Time Series for Complex Physical Systems (LU, TY, HC, GJ, EJK, KZ), pp. 2167–2176.
SEKE-2015-YungLC #black box #complexity: An Average Case Time Complexity Estimator for Black-box Functions (DY, BL, SKC), pp. 567–570.
SIGIR-2015-CapraACV #complexity #difference: Differences in the Use of Search Assistance for Tasks of Varying Complexity (RC, JA, AC, EV), pp. 23–32.
MoDELS-2015-EichlerMSGD #graph grammar #term rewriting: Enhanced graph rewriting systems for complex software domains (SoSyM abstract) (CE, TM, PS, LAG, KD), p. 447.
MoDELS-2015-KulkarniBCB #complexity #towards: Toward overcoming accidental complexity in organisational decision-making (VK, SB, TC, BSB), pp. 368–377.
Onward-2015-HolderTG #assessment #complexity #music #named: Musiplectics: computational assessment of the complexity of music scores (EH, ET, AG), pp. 107–120.
POPL-2015-ElangoRPRS #complexity #data access #on the #source code: On Characterizing the Data Access Complexity of Programs (VE, FR, LNP, JR, PS), pp. 567–580.
SAC-2015-Homm0G #concurrent #markov #modelling #statistics #testing: Concurrent streams in Markov chain usage models for statistical testing of complex systems (DH, JE, RG), pp. 1803–1807.
SAC-2015-OliveiraQMM #community #complexity #detection #using: Community detection, with lower time complexity, using coupled Kuramoto oscillators (JEMdO, MGQ, MDNM, EENM), pp. 1160–1166.
ESEC-FSE-2015-BangAB #automation #complexity #source code: Automatically computing path complexity of programs (LB, AA, TB), pp. 61–72.
ICSE-v1-2015-WhalenPRSG #approach #flexibility #metric: A Flexible and Non-intrusive Approach for Computing Complex Structural Coverage Metrics (MWW, SP, NR, MS, DG), pp. 506–516.
CAV-2015-Ben-AmramG #complexity #ranking: Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions (AMBA, SG), pp. 304–321.
ICLP-J-2015-AlvianoL #compilation #complexity #programming #set: Complexity and compilation of GZ-aggregates in answer set programming (MA, NL), pp. 574–587.
ICST-2015-NardoPB #analysis #generative #modelling #mutation testing #testing: Generating Complex and Faulty Test Data through Model-Based Mutation Analysis (DDN, FP, LCB), pp. 1–10.
ICST-2015-PouldingF #generative #testing: Re-Using Generators of Complex Test Data (SMP, RF), pp. 1–10.
LICS-2015-BaazLR #complexity #proving: A Note on the Complexity of Classical and Intuitionistic Proofs (MB, AL, GR), pp. 657–666.
LICS-2015-BenediktCCB #bound #complexity #logic: The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.
LICS-2015-BienvenuKP #complexity #owl #query: Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (MB, SK, VVP), pp. 317–328.
LICS-2015-BozzelliP #complexity #equilibrium #logic #on the: On the Complexity of Temporal Equilibrium Logic (LB, DP), pp. 645–656.
LICS-2015-CarvalhoMM #algebra #complexity: From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (CC, FRM, BM), pp. 462–474.
LICS-2015-DalmauEHLR #complexity #problem: Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (VD, LE, PH, BL, AR), pp. 487–498.
LICS-2015-HeijltjesH #bound #complexity #logic #petri net #proving: Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (WH, DJDH), pp. 80–91.
LICS-2015-LechnerOW #complexity #linear #on the: On the Complexity of Linear Arithmetic with Divisibility (AL, JO, JW), pp. 667–676.
RTA-2015-AvanziniST #certification #complexity #proving #using: Certification of Complexity Proofs using CeTA (MA, CS, RT), pp. 23–39.
RTA-2015-FrohnGHAS #bound #complexity #runtime: Inferring Lower Bounds for Runtime Complexity (FF, JG, JH, CA, TS), pp. 334–349.
RTA-2015-KopMS #complexity: Conditional Complexity (CK, AM, TS), pp. 223–240.
CBSE-2014-Porter #adaptation #component #composition #fine-grained #runtime: Runtime modularity in complex structures: a component model for fine grained runtime adaptation (BP), pp. 29–34.
ECSA-2014-BennaceurI #architecture #distributed: Layered Connectors — Revisiting the Formal Basis of Architectural Connection for Complex Distributed Systems (AB, VI), pp. 283–299.
ECSA-2014-FreudenreichAFB #architecture #complexity #policy #using: Using Policies for Handling Complexity of Event-Driven Architectures (TF, SA, SF, APB), pp. 114–129.
CASE-2014-ChenFSWJF #internet: Complex event processing for the Internet of Things and its applications (CYC, JHF, TS, PFW, EJ, MWF), pp. 1144–1149.
CASE-2014-HerrNV #complexity #distributed #framework #scheduling: Prognostics-based scheduling in a distributed platform: Model, complexity and resolution (NH, JMN, CV), pp. 1054–1059.
CASE-2014-ParkLK #implementation #visualisation: Implementation of spatial visualization for a tele-operated robot in a complex and hazardous environment (SP, YCL, GWK), pp. 285–289.
CASE-2014-WangFZL #artificial reality #collaboration #maintenance: An augmented reality based system for remote collaborative maintenance instruction of complex products (JW, YF, CZ, SL), pp. 309–314.
DAC-2014-KosmidisQAFWC #certification #hardware: Containing Timing-Related Certification Cost in Automotive Systems Deploying Complex Hardware (LK, EQ, JA, GF, FW, FJC), p. 6.
DAC-2014-SchaffnerGSKB #approximate #complexity #linear #realtime #video: An Approximate Computing Technique for Reducing the Complexity of a Direct-Solver for Sparse Linear Systems in Real-Time Video Processing (MS, FKG, AS, HK, LB), p. 6.
DATE-2014-AksoyFM #complexity #constant #design #multi #optimisation: Optimization of design complexity in time-multiplexed constant multiplications (LA, PFF, JCM), pp. 1–4.
DATE-2014-SarmaD #estimation #network #runtime: Minimal sparse observability of complex networks: Application to MPSoC sensor placement and run-time thermal estimation & tracking (SS, ND), pp. 1–6.
DATE-2014-ZebeleinHFST #communication #modelling #multi #protocol: Model-based actor multiplexing with application to complex communication protocols (CZ, CH, JF, TS, JT), pp. 1–4.
PODS-2014-PaghS #complexity: The input/output complexity of triangle enumeration (RP, FS), pp. 224–233.
SIGMOD-2014-KargarACGSY #database #keyword #named #relational: MeanKS: meaningful keyword search in relational databases with complex schema (MK, AA, NC, PG, JS, XY), pp. 905–908.
SIGMOD-2014-NikolicEK #incremental #maintenance #named #query: LINVIEW: incremental view maintenance for complex analytical queries (MN, ME, CK), pp. 253–264.
SIGMOD-2014-QiCRR #online #sequence: Complex event analytics: online aggregation of stream sequence patterns (YQ, LC, MR, EAR), pp. 229–240.
SIGMOD-2014-TaftVSSMS #benchmark #metric #named: GenBase: a complex analytics genomics benchmark (RT, MV, NRS, NS, SM, MS), pp. 177–188.
SIGMOD-2014-TangXS #complexity #performance: Influence maximization: near-optimal time complexity meets practical efficiency (YT, XX, YS), pp. 75–86.
SIGMOD-2014-ZhangDI #complexity #on the #optimisation #query: On complexity and optimization of expensive queries in complex event processing (HZ, YD, NI), pp. 217–228.
FoSSaCS-2014-Chatterjee0NV #complexity #game studies #probability: The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies (KC, LD, SN, MYV), pp. 242–257.
FoSSaCS-2014-Tsukada0 #call-by #complexity #model checking #source code: Complexity of Model-Checking Call-by-Value Programs (TT, NK), pp. 180–194.
TACAS-2014-BrockschmidtEFFG #analysis #complexity #integer #runtime #source code: Alternating Runtime and Size Complexity Analysis of Integer Programs (MB, FE, SF, CF, JG), pp. 140–155.
STOC-2014-Babichenko #approximate #complexity #nash #query: Query complexity of approximate nash equilibria (YB), pp. 535–544.
STOC-2014-ColeR #complexity: The sample complexity of revenue maximization (RC, TR), pp. 243–252.
STOC-2014-DanielyLS #complexity #learning: From average case complexity to improper learning complexity (AD, NL, SSS), pp. 441–448.
STOC-2014-GavinskyMWW #approach #bound #complexity #composition #towards: Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture (DG, OM, OW, AW), pp. 213–222.
STOC-2014-Rothvoss #complexity #exponential: The matching polytope has exponential extension complexity (TR), pp. 263–272.
STOC-2014-Williams14a #complexity #performance: Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.
DLT-J-2013-IbarraR14 #complexity: Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 1127–1140.
AFL-2014-GruberH #automaton #complexity #finite #regular expression #summary: From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.
AFL-2014-Valdats #complexity #regular expression: Boolean Circuit Complexity of Regular Languages (MV), pp. 342–354.
DLT-2014-BrzozowskiS #bound #complexity: Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (JAB, MS), pp. 13–24.
DLT-2014-FeliceN #algorithm #automaton #complexity #on the: On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.
DLT-2014-HanKS #complexity: State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
ICALP-v1-2014-AmbainisBGMSZ #complexity #metric: Tighter Relations between Sensitivity and Other Complexity Measures (AA, MB, YG, JM, XS, SZ), pp. 101–113.
ICALP-v1-2014-DattaHK #complexity #problem #reachability: Dynamic Complexity of Directed Reachability and Other Problems (SD, WH, RK), pp. 356–367.
ICALP-v1-2014-DregiL #complexity: Parameterized Complexity of Bandwidth on Trees (MSD, DL), pp. 405–416.
ICALP-v1-2014-IvanyosKQSS #complexity #constraints #fault #on the #problem: On the Complexity of Trial and Error for Constraint Satisfaction Problems (GI, RK, YQ, MS, AS), pp. 663–675.
ICALP-v1-2014-KhotTW #approximate #complexity: The Complexity of Somewhat Approximation Resistant Predicates (SK, MT, PW), pp. 689–700.
ICALP-v1-2014-WimmerWZ #complexity #matrix #query: Optimal Query Complexity for Estimating the Trace of a Matrix (KW, YW, PZ), pp. 1051–1062.
ICALP-v2-2014-BellBMR #complexity #symmetry: Symmetric Groups and Quotient Complexity of Boolean Operations (JB, JAB, NM, RR), pp. 1–12.
ICALP-v2-2014-BundalaO #complexity #on the: On the Complexity of Temporal-Logic Path Checking (DB, JO), pp. 86–97.
ICALP-v2-2014-ChatterjeeI #complexity #game studies: The Complexity of Ergodic Mean-payoff Games (KC, RIJ), pp. 122–133.
ICALP-v2-2014-KieferW #automaton #complexity #probability: Stability and Complexity of Minimising Probabilistic Automata (SK, BW), pp. 268–279.
LATA-2014-FormentiHKP #complexity: ω-rational Languages: High Complexity Classes vs. Borel Hierarchy (EF, MH, MK, JP), pp. 372–383.
LATA-2014-Prusa #complexity: Weight-Reducing Hennie Machines and Their Descriptional Complexity (DP), pp. 553–564.
LATA-2014-Vorel #automaton #complexity #problem #word: Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.
LATA-2014-ZhengGQ #automaton #complexity #finite #on the: On the State Complexity of Semi-quantum Finite Automata (SZ, JG, DQ), pp. 601–612.
CSCW-2014-AndreKD #category theory #clustering #synthesis: Crowd synthesis: extracting categories and clusters from complex data (PA, AK, SPD), pp. 989–998.
DUXU-DP-2014-ChunpirB0: User Support System in the Complex Environment (HIC, AAB, TL), pp. 392–402.
HCI-AS-2014-TsengT #complexity #correlation #design #online #trust #visual notation: The Correlation between Visual Complexity and User Trust in On-line Shopping: Implications for Design (KTT, YCT), pp. 90–99.
HIMI-AS-2014-CaldwellV #interface: Improving Control Room State Awareness through Complex Sonification Interfaces (BSC, JEV), pp. 317–323.
LCT-TRE-2014-ShahoumianSZPH #education #learning #simulation: Blended Simulation Based Medical Education: A Complex Learning/Training Opportunity (AS, MS, MZ, GP, JH), pp. 478–485.
LCT-TRE-2014-Stylianou-GeorgiouPI #education #monitoring #web: Monitoring Teachers’ Complex Thinking while Engaging in Philosophical Inquiry with Web 2.0 (ASG, AP, AI), pp. 319–327.
SCSM-2014-Kanawati #community #detection #network: Seed-Centric Approaches for Community Detection in Complex Networks (RK), pp. 197–208.
EDOC-2014-HalleV #formal method: A Formalization of Complex Event Stream Processing (SH, SV), pp. 2–11.
ICEIS-v1-2014-PequenoG #integration #relational #specification: Specifying Complex Correspondences Between Relational Schemas in a Data Integration Environment (VMP, HG), pp. 18–29.
ICEIS-v2-2014-Chung #complexity #profiling #realtime #towards: Towards Real-time Static and Dynamic Profiling of Organisational Complexity (KSKC), pp. 466–471.
CIKM-2014-AwadallahWPDW: Supporting Complex Search Tasks (AHA, RWW, PP, STD, YMW), pp. 829–838.
CIKM-2014-EickhoffV #modelling: Modelling Complex Relevance Spaces with Copulas (CE, APdV), pp. 1831–1834.
CIKM-2014-ShaoKTG #case study #complexity #distance #navigation #network #query: Travel distance versus navigation complexity: a study on different spatial queries on road networks (JS, LK, ET, LG), pp. 1791–1794.
ICML-c1-2014-GopalanMM #online #problem: Thompson Sampling for Complex Online Problems (AG, SM, YM), pp. 100–108.
ICML-c2-2014-DaneshmandGSS #algorithm #complexity #network: Estimating Diffusion Network Structures: Recovery Conditions, Sample Complexity & Soft-thresholding Algorithm (HD, MGR, LS, BS), pp. 793–801.
ICML-c2-2014-LevineK #learning #network #optimisation #policy: Learning Complex Neural Network Policies with Trajectory Optimization (SL, VK), pp. 829–837.
ICML-c2-2014-ZhaoMXZZ #analysis #component #robust: Robust Principal Component Analysis with Complex Noise (QZ, DM, ZX, WZ, LZ), pp. 55–63.
ICPR-2014-BaiHRE #complexity #graph: Directed Depth-Based Complexity Traces of Hypergraphs from Directed Line Graphs (LB, ERH, PR, FE), pp. 3874–3879.
ICPR-2014-DahlCB #image #multi #segmentation #using: Multiphase Image Segmentation Using the Deformable Simplicial Complex Method (VAD, ANC, JAB), pp. 1002–1007.
ICPR-2014-DamoulasHBGA #kernel #string: String Kernels for Complex Time-Series: Counting Targets from Sensed Movement (TD, JH, RB, CPG, AA), pp. 4429–4434.
ICPR-2014-HongZP #analysis #estimation #image: Pose Estimation via Complex-Frequency Domain Analysis of Image Gradient Orientations (XH, GZ, MP), pp. 1740–1745.
ICPR-2014-HuML #composition #probability: Dynamic Task Decomposition for Probabilistic Tracking in Complex Scenes (TH, SM, OL), pp. 4134–4139.
ICPR-2014-MoeiniMAF #2d #3d #image #invariant #modelling #recognition #women: Makeup-Invariant Face Recognition by 3D Face: Modeling and Dual-Tree Complex Wavelet Transform from Women’s 2D Real-World Images (AM, HM, FA, KF), pp. 1710–1715.
ICPR-2014-RenL #gender #recognition #using: Gender Recognition Using Complexity-Aware Local Features (HR, ZNL), pp. 2389–2394.
ICPR-2014-SatoKSK #classification #learning #multi: Learning Multiple Complex Features Based on Classification Results (YS, KK, YS, MK), pp. 3369–3373.
KDD-2014-LiARS #complexity #modelling #topic: Reducing the sampling complexity of topic models (AQL, AA, SR, AJS), pp. 891–900.
KR-2014-HaanS #complexity #problem #reasoning: The Parameterized Complexity of Reasoning Problems Beyond NP (RdH, SS).
KR-2014-KrotzschR #logic: Nominal Schemas in Description Logics: Complexities Clarified (MK, SR).
KR-2014-StrassW #approximate #complexity #fixpoint #framework: Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory (HS, JPW).
SEKE-2014-AlemerienM #complexity #named #user interface #visual notation: GUIEvaluator: A Metric-tool for Evaluating the Complexity of Graphical User Interfaces (KA, KM), pp. 13–18.
SIGIR-2014-QvarfordtTGD #named: SearchPanel: framing complex search needs (PQ, ST, GG, TD), pp. 495–504.
SIGIR-2014-SavenkovA #effectiveness: To hint or not: exploring the effectiveness of search hints for complex informational tasks (DS, EA), pp. 1115–1118.
MoDELS-2014-DavidRV #model transformation #streaming: Streaming Model Transformations By Complex Event Processing (ID, IR, DV), pp. 68–83.
MoDELS-2014-EnriciAP #approach #communication #modelling #uml: A UML Model-Driven Approach to Efficiently Allocate Complex Communication Schemes (AE, LA, RP), pp. 370–385.
MoDELS-2014-DavidRV #model transformation #streaming: Streaming Model Transformations By Complex Event Processing (ID, IR, DV), pp. 68–83.
MoDELS-2014-EnriciAP #approach #communication #modelling #uml: A UML Model-Driven Approach to Efficiently Allocate Complex Communication Schemes (AE, LA, RP), pp. 370–385.
SAC-2014-PereiraS #complexity #deduction #source code: Complexity checking of ARM programs, by deduction (MP, SMdS), pp. 1309–1314.
FSE-2014-DingesA #heuristic: Solving complex path conditions through heuristic search on induced polytopes (PD, GAA), pp. 425–436.
SPLC-2014-UrliBC #approach #product line: Handling complex configurations in software product lines: a tooled approach (SU, MBF, PC), pp. 112–121.
ASPLOS-2014-DingZZES #compilation #complexity #runtime #scheduling: Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems (YD, MZ, ZZ, SE, XS), pp. 607–622.
OSDI-2014-PillaiCAAAA #complexity #file system: All File Systems Are Not Created Equal: On the Complexity of Crafting Crash-Consistent Applications (TSP, VC, RA, SAK, ACAD, RHAD), pp. 433–448.
CAV-2014-SinnZV #bound #complexity #scalability #static analysis: A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (MS, FZ, HV), pp. 745–761.
ICST-2014-KifetewJTOT #grammarware #source code: Reproducing Field Failures for Programs with Complex Grammar-Based Input (FMK, WJ, RT, AO, PT), pp. 163–172.
ICTSS-2014-DoganayEAB #embedded #search-based #testing: Search-Based Testing for Embedded Telecom Software with Complex Input Structures (KD, SE, WA, MB), pp. 205–210.
IJCAR-2014-BeyersdorffC #complexity #proving #theorem proving: The Complexity of Theorem Proving in Circumscription and Minimal Entailment (OB, LC), pp. 403–417.
ISSTA-2014-BohmeR #complexity #fault #named: CoREBench: studying complexity of regression errors (MB, AR), pp. 105–115.
LICS-CSL-2014-BaierKKW #complexity #decidability #linear #logic #monitoring: Weight monitoring with linear temporal logic: complexity and decidability (CB, JK, SK, SW), p. 10.
LICS-CSL-2014-BrenguierRS #complexity #game studies: The complexity of admissibility in ω-regular games (RB, JFR, MS), p. 10.
LICS-CSL-2014-ChenM #classification #complexity #graph #query: One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.
LICS-CSL-2014-KlinLOT #complexity #constraints #problem #turing machine: Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (BK, SL, JO, ST), p. 10.
LICS-CSL-2014-LazicS #branch: Non-elementary complexities for branching VASS, MELL, and extensions (RL, SS), p. 10.
RTA-TLCA-2014-HirokawaM #analysis #automation #complexity: Automated Complexity Analysis Based on Context-Sensitive Rewriting (NH, GM), pp. 257–271.
RTA-TLCA-2014-SternagelT #algebra #certification #complexity #formal method #proving #termination: Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs (CS, RT), pp. 441–455.
SAT-2014-BalabanovWJ #proving: QBF Resolution Systems and Their Proof Complexities (VB, MW, JHRJ), pp. 154–169.
SAT-2014-IstrateC #complexity #proving #theorem: Proof Complexity and the Kneser-Lovász Theorem (GI, AC), pp. 138–153.
SAT-2014-Nordstrom #bibliography #complexity #proving #satisfiability: A (Biased) Proof Complexity Survey for SAT Practitioners (JN), pp. 1–6.
VMCAI-2014-AcunaAMS #approach #complexity #heuristic #modelling #network: Modeling Parsimonious Putative Regulatory Networks: Complexity and Heuristic Approach (VA, AA, AM, AS), pp. 322–336.
ASE-2013-PohlSP #complexity #feature model #modelling: Measuring the structural complexity of feature models (RP, VS, KP), pp. 454–464.
CASE-2013-Holzmuller-LaueGT #automation #modelling #workflow: Model-driven complex workflow automation for laboratories (SHL, BG, KT), pp. 758–763.
DAC-2013-HuKM #complexity #coordination: Taming the complexity of coordinated place and route (JH, MCK, ILM), p. 7.
DAC-2013-ZhouLJ #3d #complexity #finite #linear #multi #scalability: A direct finite element solver of linear complexity for large-scale 3-D circuit extraction in multiple dielectrics (BZ, HL, DJ), p. 6.
DATE-2013-JoshiLBBG #estimation #performance #statistics: A gate level methodology for efficient statistical leakage estimation in complex 32nm circuits (SJ, AL, MB, EB, SG), pp. 1056–1057.
DATE-2013-KhanSGH #collaboration #complexity #reduction: Hardware-software collaborative complexity reduction scheme for the emerging HEVC intra encoder (MUKK, MS, MG, JH), pp. 125–128.
DATE-2013-RustLP #architecture #complexity #using: Low complexity QR-decomposition architecture using the logarithmic number system (JR, FL, SP), pp. 97–102.
DRR-2013-XuTTS #documentation #segmentation: Graphic composite segmentation for documents with complex layouts (CX, ZT, XT, CS).
HT-2013-BurelH #community #complexity #maturity #online: A question of complexity: measuring the maturity of online enquiry communities (GB, YH), pp. 1–10.
PODS-2013-ChenM #classification #complexity #query: The fine classification of conjunctive queries and parameterized logarithmic space complexity (HC, MM), pp. 309–320.
PODS-2013-KimelfeldK #complexity #mining: The complexity of mining maximal frequent subgraphs (BK, PGK), pp. 13–24.
SIGMOD-2013-ZhangEPS #query #reverse engineering: Reverse engineering complex join queries (MZ, HE, CMP, DS), pp. 809–820.
VLDB-2013-BambaRHA #geometry #graph #performance #statistics: Statistics Collection in Oracle Spatial and Graph: Fast Histogram Construction for Complex Geometry Objects (BB, SR, YH, RA), pp. 1021–1032.
VLDB-2013-DengF #complexity #on the #query: On the Complexity of Query Result Diversification (TD, WF), pp. 577–588.
VLDB-2013-KimelfeldVW #approximate #complexity #multi: Multi-Tuple Deletion Propagation: Approximations and Complexity (BK, JV, DPW), pp. 1558–1569.
VLDB-2013-SzlichtaGGZ #complexity #dependence #order: Expressiveness and Complexity of Order Dependencies (JS, PG, JG, CZ), pp. 1858–1869.
ITiCSE-2013-Trakhtenbrot #algorithm #analysis #complexity #concept #problem #student: Students misconceptions in analysis of algorithmic and computational complexity of problems (MT), pp. 353–354.
FoSSaCS-2013-HainryMP #analysis #complexity #process #type system: Type-Based Complexity Analysis for Fork Processes (EH, JYM, RP), pp. 305–320.
FoSSaCS-2013-KarandikarS #complexity #parametricity #problem #recursion: The Parametric Ordinal-Recursive Complexity of Post Embedding Problems (PK, SS), pp. 273–288.
ICSM-2013-HolySBJ #component #visualisation: A Visualization Tool for Reverse-Engineering of Complex Component Applications (LH, JS, PB, KJ), pp. 500–503.
SCAM-2013-JbaraF #assessment #complexity #linux: Characterization and assessment of the linux configuration complexity (AJ, DGF), pp. 11–20.
WCRE-2013-SchoenmakersBNVS #complexity: Assessing the complexity of upgrading software modules (BS, NvdB, IN, BV, AS), pp. 433–440.
STOC-2013-BeiCZ #complexity #fault #on the: On the complexity of trial and error (XB, NC, SZ), pp. 31–40.
STOC-2013-BravermanM #approach #complexity: An information complexity approach to extended formulations (MB, AM), pp. 161–170.
STOC-2013-BurgisserI #bound #complexity #geometry: Explicit lower bounds via geometric complexity theory (PB, CI), pp. 141–150.
STOC-2013-ChenPY #complexity: The complexity of non-monotone markets (XC, DP, MY), pp. 181–190.
STOC-2013-SinclairS #complexity #theorem: Lee-Yang theorems and the complexity of computing averages (AS, PS), pp. 625–634.
STOC-2013-ThapperZ #complexity: The complexity of finite-valued CSPs (JT, SZ), pp. 695–704.
CIAA-J-2012-Brzozowski13 #regular expression: In Search of Most Complex Regular Languages (JAB), pp. 691–708.
CIAA-J-2012-KutribO13 #automaton #complexity #on the: On the Descriptional Complexity of the Window Size for Deleting Restarting Automata (MK, FO), pp. 831–846.
DLT-J-2012-BrzozowskiT13 #complexity #regular expression: Complexity of atoms of Regular Languages (JAB, HT), pp. 1009–1028.
CIAA-2013-BrzozowskiL #complexity: Universal Witnesses for State Complexity of Basic Operations Combined with Reversal (JAB, DL), pp. 72–83.
CIAA-2013-MaiaMR #complexity #finite: Incomplete Transition Complexity of Basic Operations on Finite Languages (EM, NM, RR), pp. 349–356.
DLT-2013-Blanchet-SadriF #complexity #on the #word: On the Asymptotic Abelian Complexity of Morphic Words (FBS, NF), pp. 94–105.
DLT-2013-GocSS #complexity: Subword Complexity and k-Synchronization (DG, LS, JS), pp. 252–263.
DLT-2013-IbarraR #complexity: Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 264–276.
ICALP-v1-2013-AvisT #combinator #complexity #on the: On the Extension Complexity of Combinatorial Polytopes (DA, HRT), pp. 57–68.
ICALP-v1-2013-BohlerCKLPZ #complexity #diagrams #higher-order #on the: On the Complexity of Higher Order Abstract Voronoi Diagrams (CB, PC, RK, CHL, EP, MZ), pp. 208–219.
ICALP-v1-2013-GuoW #complexity #csp: The Complexity of Planar Boolean #CSP with Complex Weights (HG, TW), pp. 516–527.
ICALP-v1-2013-GurR #complexity #streaming: Arthur-Merlin Streaming Complexity (TG, RR), pp. 528–539.
ICALP-v1-2013-HirtR #complexity #on the: On the Complexity of Broadcast Setup (MH, PR), pp. 552–563.
ICALP-v1-2013-LauriaPRT #complexity #graph #proving: The Complexity of Proving That a Graph Is Ramsey (ML, PP, VR, NT), pp. 684–695.
ICALP-v1-2013-Leonardos #bound #complexity #random #recursion: An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (NL), pp. 696–708.
ICALP-v1-2013-Uppman #complexity: The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom (HU), pp. 804–815.
ICALP-v1-2013-Velner #complexity #game studies #infinity: The Complexity of Infinitely Repeated Alternating Move Games (YV), pp. 816–827.
ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving: Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.
ICALP-v2-2013-BenaimBCKLMW #complexity #finite #logic: Complexity of Two-Variable Logic on Finite Trees (SB, MB, WC, EK, RL, FM, JW), pp. 74–88.
ICALP-v2-2013-DemriDS #complexity #on the #verification: On the Complexity of Verifying Regular Properties on Flat Counter Systems, (SD, AKD, AS), pp. 162–173.
ICALP-v2-2013-HartungNNS #analysis #complexity #graph: A Refined Complexity Analysis of Degree Anonymization in Graphs (SH, AN, RN, OS), pp. 594–606.
ICALP-v2-2013-LeivantM #complexity #evolution: Evolving Graph-Structures and Their Implicit Computational Complexity (DL, JYM), pp. 349–360.
ICALP-v2-2013-LipmaaT #complexity #online #similarity #sublinear #testing: Secure Equality and Greater-Than Tests with Sublinear Online Complexity (HL, TT), pp. 645–656.
LATA-2013-AlurKTY #complexity #graph #on the #problem: On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.
LATA-2013-BenzaidDE #algorithm #complexity: Duplication-Loss Genome Alignment: Complexity and Algorithm (BB, RD, NEM), pp. 116–127.
LATA-2013-Cai #complexity #problem: Complexity Dichotomy for Counting Problems (JYC), pp. 1–11.
LATA-2013-DelzannoT #complexity #decidability #network #verification: Decidability and Complexity Results for Verification of Asynchronous Broadcast Networks (GD, RT), pp. 238–249.
LATA-2013-FreivaldsZP #automaton #complexity #on the: On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.
GT-VMT-2013-BottoniP: Annotations on Complex Patterns (PB, FPP).
CHI-2013-LugerMR #complexity: Consent for all: revealing the hidden complexity of terms and conditions (EL, SM, TR), pp. 2687–2696.
CHI-2013-ReineckeYMMZLG #complexity #predict #quantifier #visual notation: Predicting users’ first impressions of website aesthetics with a quantification of perceived visual complexity and colorfulness (KR, TY, LM, RM, YZ, JL, KZG), pp. 2049–2058.
CSCW-2013-JungLDAHB #using: Engaging robots: easing complex human-robot teamwork using backchanneling (MFJ, JJL, ND, SOA, PJH, CB), pp. 1555–1566.
DHM-HB-2013-LiWZYHZ #complexity #variability: Changes in Heart Rate Variability during Manual Controlled Rendezvous and Docking with Task Complexity (PL, BW, YZ, ZY, WH, XZ), pp. 86–92.
DHM-SET-2013-GoreM #approach #modelling #performance #validation: A Validation Approach for Complex NextGen Air Traffic Control Human Performance Models (BFG, PM), pp. 28–37.
DHM-SET-2013-WangZWLCZL #complexity #fault: Effects of Spaceflight Operation Complexity and Training on Operation Error (MW, YZ, BW, PL, SC, JZ, ML), pp. 118–125.
DUXU-PMT-2013-FilippiBFBC #interactive #simulation: Human in the Loop: A Model to Integrate Interaction Issues in Complex Simulations (SF, DB, FF, MB, UC), pp. 242–251.
HCI-III-2013-Joo #behaviour #reasoning #simulation: Perception and BDI Reasoning Based Agent Model for Human Behavior Simulation in Complex System (JJ), pp. 62–71.
HIMI-D-2013-KaoW #complexity: The Right Level of Complexity in a Banner Ad: Roles of Construal Level and Fluency (CTK, MYW), pp. 604–613.
HIMI-D-2013-NitscheN13a #named #query: QUEST: Querying Complex Information by Direct Manipulation (MN, AN), pp. 240–249.
HIMI-LCCB-2013-BraunerRGSZ: Human Factors in Supply Chain Management — Decision Making in Complex Logistic Scenarios (PB, SR, MG, GS, MZ), pp. 423–432.
HILT-2013-WardRL #approach #integration #process: An approach to integration of complex systems: the SAVI virtual integration process (DTW, DAR, BAL), pp. 43–46.
CAiSE-2013-BoukraaBBZ #multi: A Layered Multidimensional Model of Complex Objects (DB, OB, FB, DEZ), pp. 498–513.
CAiSE-2013-Espada0A #complexity #framework #modelling: A Framework to Evaluate Complexity and Completeness of KAOS Goal Models (PE, MG, JA), pp. 562–577.
ICEIS-v1-2013-AliCCCGSS #enterprise #industrial #named: AMICO: The Asset Management for Industrial Complex Enterprise (SA, GC, SC, FC, LG, FS, AS), pp. 423–429.
ICEIS-v1-2013-BimonteBPK #design #implementation #modelling #multi #uml: Design of Complex Spatio-multidimensional Models with the ICSOLAP UML Profile — An Implementation in MagicDraw (SB, KB, FP, MAK), pp. 310–315.
ICEIS-v1-2013-DombiD #modelling #using: Modelling Complex Systems using the Pliant Cognitive Map (JDD, JD), pp. 506–512.
ICEIS-v3-2013-KimOK #architecture #enterprise #framework #modelling: Complex Event as an Core Aspect of Enterprise Architecture — EDEMF: Event Driven Enterprise Architecture Modeling Framework (HK, SO, PK), pp. 292–301.
ICEIS-v3-2013-LambeckG #complexity #concept #enterprise #scalability #user interface: Mastering ERP Interface Complexity — A Scalable User Interface Concept for ERP Systems (CL, RG), pp. 170–178.
ICML-c2-2013-Hui #modelling #visual notation: Direct Modeling of Complex Invariances for Visual Object Features (KYH), pp. 352–360.
ICML-c3-2013-LattimoreHS #learning: The Sample-Complexity of General Reinforcement Learning (TL, MH, PS), pp. 28–36.
KDD-2013-AbrahaoCKP #complexity #network: Trace complexity of network inference (BDA, FC, RK, AP), pp. 491–499.
KDD-2013-SunBK #identification #optimisation #polynomial: Quadratic optimization to identify highly heritable quantitative traits from complex phenotypic features (JS, JB, HRK), pp. 811–819.
KDD-2013-WuLYT #mining #sequence: Mining high utility episodes in complex event sequences (CWW, YFL, PSY, VST), pp. 536–544.
KDIR-KMIS-2013-CechTBH #complexity #modelling #multi: Modelling Complexity of Economic System with Multi-Agent Systems (PC, PT, VB, MH), pp. 464–469.
RecSys-2013-SavirBS #recommendation: Recommending improved configurations for complex objects with an application in travel planning (AS, RIB, GS), pp. 391–394.
SEKE-2013-JulianoTSM #assessment #automation #case study #complexity #similarity: Automated Computation of Use Cases Similarity can Aid the Assessment of Cohesion and Complexity of Classes (S) (RCJ, BANT, MSS, MdAM), pp. 494–499.
SIGIR-2013-HeBV #multi #query: Characterizing stages of a multi-session complex search task through direct and indirect query modifications (JH, MB, APdV), pp. 897–900.
SKY-2013-RineF #complexity #information management #metric #quality #representation #requirements #using: Requirements Quality Knowledge Representation using Chunking Complexity Measurement: Prior to Formal Inspections (DCR, AF), pp. 3–13.
MoDELS-2013-HebigGSS #evolution #on the: On the Complex Nature of MDE Evolution (RH, HG, FS, AS), pp. 436–453.
MoDELS-2013-HebigGSS #evolution #on the: On the Complex Nature of MDE Evolution (RH, HG, FS, AS), pp. 436–453.
ECOOP-2013-AuerbachBCFR #compilation #configuration management #graph #hardware: The Shape of Things to Run — Compiling Complex Stream Graphs to Reconfigurable Hardware in Lime (JSA, DFB, PC, SF, RMR), pp. 679–706.
QAPL-2013-ArulR #complexity #game studies #integer: The Complexity of Robot Games on the Integer Line (AA, JR), pp. 132–148.
SAC-2013-BruyninckxKHKGB #component #development #modelling #paradigm: The BRICS component model: a model-based development paradigm for complex robotics software systems (HB, MK, NH, GKK, LG, DB), pp. 1758–1764.
SAC-2013-GaoB #architecture: User centric complex event processing based on service oriented architectures (FG, SB), pp. 1933–1934.
SAC-2013-MaiaB #modelling #network #performance #predict #query: Sensor-field modeling based on in-network data prediction: an efficient strategy for answering complex queries in wireless sensor networks (JEBM, AB), pp. 554–559.
ICSE-2013-AlrajehRLMMN: Computational alignment of goals and scenarios for complex systems (DA, AR, JL, NAMM, AM, MN), pp. 1249–1252.
PPoPP-2013-WuZZJS #algorithm #analysis #complexity #design #gpu #memory management: Complexity analysis and algorithm design for reorganizing data to minimize non-coalesced memory accesses on GPU (BW, ZZ, EZZ, YJ, XS), pp. 57–68.
CSL-2013-BulatovDT #approximate #complexity: Descriptive complexity of approximate counting CSPs (AAB, VD, MT), pp. 149–164.
CSL-2013-SchmidtW #abduction #complexity #constraints #similarity: The Complexity of Abduction for Equality Constraint Languages (JS, MW), pp. 615–633.
LICS-2013-BolligKM #complexity #model checking #multi: The Complexity of Model Checking Multi-stack Systems (BB, DK, RM), pp. 163–172.
LICS-2013-FereeHG #complexity #on the #query: On the Query Complexity of Real Functionals (HF, MH, WG), pp. 103–112.
LICS-2013-MontanariS #complexity #equivalence #logic: Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness (AM, PS), pp. 193–202.
RTA-2013-AvanziniM #complexity #framework: A Combination Framework for Complexity (MA, GM), pp. 55–70.
RTA-2013-AvanziniM13a #complexity: Tyrolean Complexity Tool: Features and Usage (MA, GM), pp. 71–80.
RTA-2013-Schmidt-SchaussRS #algorithm #complexity: Algorithms for Extended α-Equivalence and Complexity (MSS, CR, DS), pp. 255–270.
SAT-2013-Beyersdorff #complexity #logic #proving #theorem proving: The Complexity of Theorem Proving in Autoepistemic Logic (OB), pp. 365–376.
SAT-2013-Toran #complexity #graph #morphism #on the: On the Resolution Complexity of Graph Non-isomorphism (JT), pp. 52–66.
VMCAI-2013-Leitner-FischerL #modelling: Causality Checking for Complex System Models (FLF, SL), pp. 248–267.
ASE-2012-CicchettiCMPPZV #development #industrial #modelling #named: CHESS: a model-driven engineering tool environment for aiding the development of complex industrial systems (AC, FC, SM, SP, MP, AZ, TV), pp. 362–365.
ASE-2012-Nogueira #complexity #predict #testing: Predicting software complexity by means of evolutionary testing (AFN), pp. 402–405.
CASE-2012-BilykM #heuristic #parallel #problem #search-based: Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops (AB, LM), pp. 419–424.
CASE-2012-DriesselM #case study #composition #heuristic #scheduling: An exploratory study of a decomposition heuristic for complex shop scheduling with transportation (RD, LM), pp. 413–418.
CASE-2012-LiLCS #3d: Extended RRT-based path planning for flying robots in complex 3D environments with narrow passages (DL, QL, NC, JS), pp. 1173–1178.
CASE-2012-LiuJCLX #analysis #canonical #correlation #fault #identification #linear #research: Research on fault identification for complex system based on generalized linear canonical correlation analysis (DL, DJ, XC, AL, GX), pp. 474–478.
CASE-2012-NazeemR #algorithm #performance #resource management: An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems (AN, SAR), pp. 686–693.
CASE-2012-WigstromL #behaviour #scheduling: Scheduling model for systems with complex alternative behaviour (OW, BL), pp. 587–593.
CASE-2012-YaguchiKS #pipes and filters: In-piping actuator capable of free movement in a thin complex pipe (HY, KK, KS), pp. 630–634.
DATE-2012-AbeleinLHS #challenge #complexity #quality #robust: Complexity, quality and robustness — the challenges of tomorrow’s automotive electronics (UA, HL, DH, SS), pp. 870–871.
DATE-2012-AksoyCFM #design #finite: Design of low-complexity digital finite impulse response filters on FPGAs (LA, EC, PFF, JCM), pp. 1197–1202.
DATE-2012-BeckerDFMPV #embedded #evolution #modelling #named #scalability #verification: MOUSSE: Scaling modelling and verification to complex Heterogeneous Embedded Systems evolution (MB, GBD, FF, WM, GP, SV), pp. 296–299.
DATE-2012-HeuserSS #modelling: Revealing side-channel issues of complex circuits by enhanced leakage models (AH, WS, MS), pp. 1179–1184.
DATE-2012-YuBL #adaptation #complexity #power management: A complexity adaptive channel estimator for low power (ZY, CHvB, HL), pp. 1531–1536.
DRR-2012-GaoZN #complexity #online #recognition #reduction: Complexity reduction with recognition rate maintained for online handwritten Japanese text recognition (JG, BZ, MN).
PODS-2012-DengFG #complexity #on the #problem #recommendation: On the complexity of package recommendation problems (TD, WF, FG), pp. 261–272.
PODS-2012-Kimelfeld #complexity #dependence #functional: A dichotomy in the complexity of deletion propagation with functional dependencies (BK), pp. 191–202.
PODS-2012-LosemannM #complexity: The complexity of evaluating path expressions in SPARQL (KL, WM), pp. 101–112.
SIGMOD-2012-MozafariZZ #xml: High-performance complex event processing over XML streams (BM, KZ, CZ), pp. 253–264.
VLDB-2012-CautisK #complexity #probability #query #using #xml: Answering Queries using Views over Probabilistic XML: Complexity and Tractability (BC, EK), pp. 1148–1159.
VLDB-2012-MamourasOSKG #complexity #coordination #social: The Complexity of Social Coordination (KM, SO, LS, LK, JG), pp. 1172–1183.
VLDB-2012-MorishimaSMAF #crowdsourcing #declarative #framework #named: CyLog/Crowd4U: A Declarative Platform for Complex Data-centric Crowdsourcing (AM, NS, TM, HA, SF), pp. 1918–1921.
VLDB-2012-WenzelEMK #query: Complex Preference Queries Supporting Spatial Applications for User Groups (FW, ME, SM, WK), pp. 1946–1949.
ITiCSE-2012-BrownPSE #analysis #complexity #generative #named: JUG: a JUnit generation, time complexity analysis and reporting tool to streamline grading (CB, RP, BS, JE), pp. 99–104.
FoSSaCS-2012-ChenBW #complexity #on the #probability #similarity: On the Complexity of Computing Probabilistic Bisimilarity (DC, FvB, JW), pp. 437–451.
FoSSaCS-2012-KieferMOWW #automaton #complexity #equivalence #on the #probability #problem: On the Complexity of the Equivalence Problem for Probabilistic Automata (SK, ASM, JO, BW, JW), pp. 467–481.
CSMR-2012-TerceiroMCC #analysis #complexity #comprehension #evolution: Understanding Structural Complexity Evolution: A Quantitative Analysis (ASdAT, MGM, CC, DSC), pp. 85–94.
ICPC-2012-KatzmarskiK #complexity #metric: Program complexity metrics and programmer opinions (BK, RK), pp. 17–26.
SCAM-2012-VinjuG #complexity #control flow #metric #what: What Does Control Flow Really Look Like? Eyeballing the Cyclomatic Complexity Metric (JJV, MWG), pp. 154–163.
STOC-2012-Braverman #complexity #interactive: Interactive information complexity (MB), pp. 505–524.
STOC-2012-CaiC #complexity #csp: Complexity of counting CSP with complex weights (JYC, XC), pp. 909–920.
STOC-2012-DobzinskiV #complexity #query: From query complexity to computational complexity (SD, JV), pp. 1107–1116.
STOC-2012-HuynhN #communication #complexity #on the #proving #trade-off: On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity (TH, JN), pp. 233–248.
STOC-2012-Larsen #complexity: The cell probe complexity of dynamic range counting (KGL), pp. 85–94.
STOC-2012-Sherstov #communication #complexity #multi #set: The multiparty communication complexity of set disjointness (AAS), pp. 525–548.
AFL-J-2011-BrzozowskiL12 #complexity: Quotient Complexity of Star-Free Languages (JAB, BL), pp. 1261–1276.
DLT-J-2011-GaoY12 #approximate #complexity: State Complexity and Approximation (YG, SY), pp. 1085–1098.
CIAA-2012-Brzozowski #regular expression: In Search of Most Complex Regular Languages (JAB), pp. 5–24.
CIAA-2012-JiraskovaM #complexity #on the: On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
CIAA-2012-KutribO #automaton #complexity #on the: On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.
DLT-2012-BrzozowskiT #regular expression: Quotient Complexities of Atoms of Regular Languages (JAB, HT), pp. 50–61.
DLT-2012-GandhiKL #complexity #finite #on the #word: On State Complexity of Finite Word and Tree Languages (AG, BK, JL), pp. 392–403.
DLT-2012-JiraskovaS #complexity: The State Complexity of Star-Complement-Star (GJ, JS), pp. 380–391.
ICALP-v1-2012-AdaCFN #communication #complexity #multi: The NOF Multiparty Communication Complexity of Composed Functions (AA, AC, OF, PN), pp. 13–24.
ICALP-v1-2012-Bauwens #complexity: Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity (BB), pp. 100–108.
ICALP-v1-2012-GoldbergJ #approximate #complexity #polynomial: The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (LAG, MJ), pp. 399–410.
ICALP-v1-2012-HalldorssonSSW #approximate #clique #communication #complexity #streaming: Streaming and Communication Complexity of Clique Approximation (MMH, XS, MS, CW), pp. 449–460.
ICALP-v1-2012-JefferyKM #complexity #graph #matrix #multi #quantum #query #using: Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.
ICALP-v1-2012-LinC #complexity: The Parameterized Complexity of k-Edge Induced Subgraphs (BL, YC), pp. 641–652.
ICALP-v2-2012-ChiesaBEP #complexity: Computational Complexity of Traffic Hijacking under BGP and S-BGP (MC, GDB, TE, MP), pp. 476–487.
ICALP-v2-2012-Velner #automaton #complexity: The Complexity of Mean-Payoff Automaton Expression (YV), pp. 390–402.
LATA-2012-DennunzioFP #automaton #complexity: Computational Complexity of Rule Distributions of Non-uniform Cellular Automata (AD, EF, JP), pp. 204–215.
LATA-2012-Downey #complexity #tutorial: A Parameterized Complexity Tutorial (RD), pp. 38–56.
LATA-2012-ForisekKS #complexity #online: Advice Complexity of Online Coloring for Paths (MF, LK, MS), pp. 228–239.
LATA-2012-MeierSTV #complexity #logic #on the: On the Parameterized Complexity of Default Logic and Autoepistemic Logic (AM, JS, MT, HV), pp. 389–400.
ICFP-2012-EndrullisHB #complexity #equivalence #infinity #on the #specification: On the complexity of equivalence of specifications of infinite objects (JE, DH, RB), pp. 153–164.
CHI-2012-AndersenOLSLTCP #complexity #game studies: The impact of tutorials on games of varying complexity (EA, EO, YEL, RS, JL, DT, SC, ZP), pp. 59–68.
CSCW-2012-KitturKAK #named #visual notation: CrowdWeaver: visually managing complex crowd work (AK, SK, PA, RK), pp. 1033–1036.
EDOC-2012-ParaisoHRMS #framework #middleware: A Middleware Platform to Federate Complex Event Processing (FP, GH, RR, PM, LS), pp. 113–122.
ICEIS-v1-2012-Castanon-PugaGFJC #distributed #multi #social #towards: A Distributed Agency Methodology applied to Complex Social Systems — Towards a Multi-dimensional Model of the Religious Affiliation Preference (MCP, CGP, DLF, RJM, JRC), pp. 272–277.
ICEIS-v1-2012-Monch #component #design #implementation #scheduling: Design and Implementation of a Service-based Scheduling Component for Complex Manufacturing Systems (LM), pp. 284–290.
ICEIS-v3-2012-KimO #architecture #case study #enterprise #modelling: A Case Study on Modeling of Complex Event Processing in Enterprise Architecture (HK, SO), pp. 173–180.
CIKM-2012-AnHS #learning #ontology #web: Learning to discover complex mappings from web forms to ontologies (YA, XH, IYS), pp. 1253–1262.
CIKM-2012-BlessingS #complexity: Crosslingual distant supervision for extracting relations of different complexity (AB, HS), pp. 1123–1132.
CIKM-2012-ChaliHI #learning #performance: Improving the performance of the reinforcement learning model for answering complex questions (YC, SAH, KI), pp. 2499–2502.
CIKM-2012-DuanKZ #empirical #query #representation: Click patterns: an empirical representation of complex query intents (HD, EK, CZ), pp. 1035–1044.
CIKM-2012-HassanW: Task tours: helping users tackle complex search tasks (AHA, RWW), pp. 1885–1889.
CIKM-2012-LiYHCS #mvc #network #robust: Measuring robustness of complex networks under MVC attack (RHL, JXY, XH, HC, ZS), pp. 1512–1516.
CIKM-2012-WeiFLC #canonical #dependence #using: Model the complex dependence structures of financial variables by using canonical vine (WW, XF, JL, LC), pp. 1382–1391.
ICML-2012-AzarMK #complexity #generative #learning #on the: On the Sample Complexity of Reinforcement Learning with a Generative Model (MGA, RM, BK), p. 222.
ICML-2012-MairalY #analysis #complexity: Complexity Analysis of the Lasso Regularization Path (JM, BY), p. 238.
ICPR-2012-BaiHHR #clustering #complexity #graph #using: Graph clustering using graph entropy complexity traces (LB, ERH, LH, PR), pp. 2881–2884.
ICPR-2012-ChattopadhyayJC #complexity #novel #video: A novel low complexity TV video OCR system (TC, RJ, BBC), pp. 665–668.
ICPR-2012-GonzalezBYB #image: Text location in complex images (ÁG, LMB, JJYT, SB), pp. 617–620.
ICPR-2012-LiuBFF: Complex Gaussian Mixture Model for fingerprint minutiae (CL, JB, XF, JF), pp. 545–548.
ICPR-2012-RingJKE #analysis #classification #complexity #design #embedded #performance: Software-based performance and complexity analysis for the design of embedded classification systems (MR, UJ, PK, BE), pp. 2266–2269.
ICPR-2012-SlimaneZKAHI #recognition: New features for complex Arabic fonts in cascading recognition system (FS, OZ, SK, AMA, JH, RI), pp. 738–741.
KDD-2012-MatsubaraSFIY #mining #performance: Fast mining and forecasting of complex time-stamped events (YM, YS, CF, TI, MY), pp. 271–279.
KDIR-2012-FontanLAP #automation #data type #web: Automatically Extracting Complex Data Structures from the Web (LF, RLG, MÁ, AP), pp. 246–251.
KDIR-2012-HaanR #detection: Detecting Temporally Related Arithmetical Patterns — An Extension of Complex Event Processing (RdH, MR), pp. 329–332.
KEOD-2012-HmidaCBN #3d #logic #using: From 9-IM Topological Operators to Qualitative Spatial Relations using 3D Selective Nef Complexes and Logic Rules for Bodies (HBH, CC, FB, CN), pp. 208–213.
KEOD-2012-MatskanisAMMR #approach #linked data #open data #query #research: A Linked Data Approach for Querying Heterogeneous Sources — Assisting Researchers in Finding Answers to Complex Clinical Questions (NM, VA, PM, KM, JR), pp. 411–414.
KMIS-2012-WongthongthamZ #complexity #information management #metric #ontology: Ontology based Knowledge Transferability and Complexity Measurement for Knowledge Sharing (PW, BZ), pp. 5–14.
KR-2012-AdarichevaSST #complexity: Horn Belief Contraction: Remainders, Envelopes and Complexity (KVA, RHS, BS, GT).
KR-2012-CalvaneseOSS #complexity #query: The Complexity of Explaining Negative Query Answers in DL-Lite (DC, MO, MS, GS).
KR-2012-DvorakJWW: Complexity-Sensitive Decision Procedures for Abstract Argumentation (WD, MJ, JPW, SW).
KR-2012-LutzW #complexity #logic #query: Non-Uniform Data Complexity of Query Answering in Description Logics (CL, FW).
KR-2012-VlaeminckVBD #complexity #logic #order #semantics: Ordered Epistemic Logic: Semantics, Complexity and Applications (HV, JV, MB, MD).
SEKE-2012-JuniorGM #architecture #complexity #empirical #metric #product line #validation #variability: Empirical Validation of Variability-based Complexity Metrics for Software Product Line Architecture (EAdOJ, IMdSG, JCM), pp. 622–627.
SIGIR-2012-ArguelloWKE #complexity #interactive: Task complexity, vertical display and user interaction in aggregated search (JA, WCW, DK, AE), pp. 435–444.
SIGIR-2012-XueC #generative #query: Generating reformulation trees for complex queries (XX, WBC), pp. 525–534.
BX-2012-AnjorinVS #constraints #graph grammar #programming: Complex Attribute Manipulation in TGGs with Constraint-Based Programming Techniques (AA, GV, AS), pp. 68–83.
MoDELS-2012-RederE #consistency #design #incremental: Incremental Consistency Checking for Complex Design Rules and Larger Model Changes (AR, AE), pp. 202–218.
MoDELS-2012-RederE #consistency #design #incremental: Incremental Consistency Checking for Complex Design Rules and Larger Model Changes (AR, AE), pp. 202–218.
LOPSTR-2012-ChristiansenHLP #data analysis #declarative #pipes and filters: A Declarative Pipeline Language for Complex Data Analysis (HC, CTH, OTL, MP), pp. 17–34.
REFSQ-2012-GulkeRJA #complexity #development #problem #requirements: High-Level Requirements Management and Complexity Costs in Automotive Development Projects: A Problem Statement (TG, BR, MJ, JA), pp. 94–100.
SAC-2012-BromanFHA #comparison #domain-specific language #implementation: A comparison of two metacompilation approaches to implementing a complex domain-specific language (DB, PF, GH, JÅ), pp. 1919–1921.
SAC-2012-CombiP #complexity #on the #workflow: On the complexity of temporal controllabilities for workflow schemata (CC, RP), pp. 60–66.
SAC-2012-HopRFH #ontology #using #visualisation: Using Hierarchical Edge Bundles to visualize complex ontologies in GLOW (WH, SdR, FF, FH), pp. 304–311.
SAC-2012-SalemBD #framework #xml: An Active XML-based framework for integrating complex data (RS, OB, JD), pp. 888–892.
ICSE-2012-ForbesKR #challenge #navigation #open source #research: When open source turns cold on innovation — The challenges of navigating licensing complexities in new research domains (CF, IK, JR), pp. 1447–1448.
PLEASE-2012-SozenM #adaptation #product line: Adapting software product lines for complex certifiable avionics software (NS, EM), pp. 21–24.
CSL-2012-BaillotL #complexity #higher-order: Higher-Order Interpretations and Program Complexity (PB, UDL), pp. 62–76.
CSL-2012-ChrzaszczS #complexity #ml: ML with PTIME complexity guarantees (JC, AS), pp. 198–212.
CSL-2012-Cook #complexity #proving: Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk) (SAC), pp. 9–11.
CSL-2012-GrandjeanO #complexity: Descriptive complexity for pictures languages (EG, FO), pp. 274–288.
CSL-2012-Makowsky #complexity #graph #parametricity: Definability and Complexity of Graph Parameters (Invited Talk) (JAM), pp. 14–15.
ICLP-2012-MorakW #preprocessor #programming #set: Preprocessing of Complex Non-Ground Rules in Answer Set Programming (MM, SW), pp. 247–258.
ICLP-J-2012-AlvianoFLM #complexity #datalog #decidability #quantifier #semantics: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (MA, WF, NL, MM), pp. 701–718.
ICST-2012-JonssonBSE #automation #scalability #towards #using: Towards Automated Anomaly Report Assignment in Large Complex Systems Using Stacked Generalization (LJ, DB, KS, SE), pp. 437–446.
LICS-2012-GollerJL #complexity #first-order: The Complexity of Decomposing Modal and First-Order Theories (SG, JCJ, ML), pp. 325–334.
LICS-2012-HaddadSS #complexity #petri net #recursion: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets (SH, SS, PS), pp. 355–364.
LICS-2012-JainMS #complexity: The Complexity of Verbal Languages over Groups (SJ, AM, FS), pp. 405–414.
LICS-2012-Nigam #complexity #linear #logic #on the: On the Complexity of Linear Authorization Logics (VN), pp. 511–520.
RTA-2012-Terui #complexity #evaluation #semantics #λ-calculus: Semantic Evaluation, Intersection Types and Complexity of Simply Typed λ Calculus (KT), pp. 323–338.
SAT-2012-CreignouV #complexity #problem #satisfiability: Parameterized Complexity of Weighted Satisfiability Problems (NC, HV), pp. 341–354.
SMT-2012-KovasznaiFB #complexity #logic #on the: On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (GK, AF, AB), pp. 44–56.
CASE-2011-BasileCC #analysis #automation: A discrete event model for the control and analysis of complex automated warehouse systems (FB, PC, JC), pp. 201–207.
CASE-2011-StyliosG #fuzzy #modelling #using: Modeling complex logistics systems using soft computing methodology of Fuzzy Cognitive Maps (CDS, GKG), pp. 72–77.
DAC-2011-ChaiJ #complexity #equation #linear #matrix: Direct matrix solution of linear complexity for surface integral-equation based impedance extraction of high bandwidth interconnects (WC, DJ), pp. 206–211.
DAC-2011-HuangY #algorithm: An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles (TH, EFYY), pp. 164–169.
DAC-2011-Kocher #challenge #complexity: Complexity and the challenges of securing SoCs (PK), pp. 328–331.
DAC-2011-StattelmannBR #optimisation #performance #simulation: Fast and accurate source-level simulation of software timing considering complex code optimizations (SS, OB, WR), pp. 486–491.
DATE-2011-BernardC #power management: A low-power VLIW processor for 3GPP-LTE complex numbers processing (CB, FC), pp. 234–239.
DATE-2011-ReddyCBJ #complexity #power management: A low complexity stopping criterion for reducing power consumption in turbo decoders (PR, FC, AB, MJ), pp. 649–654.
ICDAR-2011-ZhaoLL #detection #independence #robust: A Robust Color-Independent Text Detection Method from Complex Videos (YZ, TL, WL), pp. 374–378.
PODS-2011-AntonopoulosMN #complexity #xml: The complexity of text-preserving XML transformations (TA, WM, FN), pp. 247–258.
PODS-2011-HeBWN #complexity #on the #privacy: On the complexity of privacy-preserving complex event processing (YH, SB, DW, JFN), pp. 165–174.
SIGMOD-2011-KaushikR #performance #query #sql: Efficient auditing for complex SQL queries (RK, RR), pp. 697–708.
SIGMOD-2011-SoroushBW #array #named #parallel: ArrayStore: a storage manager for complex parallel array processing (ES, MB, DLW), pp. 253–264.
VLDB-2011-WangRE: Active Complex Event Processing over Event Streams (DW, EAR, RTE), pp. 634–645.
ITiCSE-2011-MarkhamZ #complexity #visualisation: A model for visualizing sentence complexity (SM, YZ), p. 357.
FASE-2011-Anderson #dependence: The Dependability of Complex Socio-technical Systems (RJA), p. 1.
FASE-2011-KelsenMG #complexity #modelling #using: Models within Models: Taming Model Complexity Using the Sub-model Lattice (PK, QM, CG), pp. 171–185.
FASE-2011-ZhangZL #api #complexity #graph: Flow-Augmented Call Graph: A New Foundation for Taming API Complexity (QZ, WZ, MRL), pp. 386–400.
FoSSaCS-2011-BernadetL #complexity #normalisation: Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (AB, SL), pp. 88–107.
ICPC-2011-TothVBG #complexity #metric #predict #process: Adding Process Metrics to Enhance Modification Complexity Prediction (GT, AZV, ÁB, TG), pp. 201–204.
ICSM-2011-KuhnK #combinator #detection #fault #testing: Practical combinatorial (t-way) methods for detecting complex faults in regression testing (RK, RK), p. 599.
SAS-2011-GorogiannisKO #abduction #abstraction #complexity: The Complexity of Abduction for Separated Heap Abstractions (NG, MIK, PWO), pp. 25–42.
STOC-2011-AaronsonA #complexity #linear: The computational complexity of linear optics (SA, AA), pp. 333–342.
STOC-2011-BurgisserI #complexity #geometry #rank: Geometric complexity theory and tensor rank (PB, CI), pp. 509–518.
STOC-2011-ChakrabartiR #bound #communication #complexity: An optimal lower bound on the communication complexity of gap-hamming-distance (AC, OR), pp. 51–60.
STOC-2011-Kopparty #complexity #finite #on the: On the complexity of powering in finite fields (SK), pp. 489–498.
STOC-2011-NovocinSV #algorithm #complexity: An LLL-reduction algorithm with quasi-linear time complexity: extended abstract (AN, DS, GV), pp. 403–412.
STOC-2011-Sherstov #communication #complexity #quantum #query #theorem: Strong direct product theorems for quantum communication and query complexity (AAS), pp. 41–50.
CIAA-J-2010-CuiGKY11 #complexity: State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection (BC, YG, LK, SY), pp. 1797–1812.
DLT-J-2010-BrodaMMR11 #approach #automaton #combinator #complexity #on the: On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach (SB, AM, NM, RR), pp. 1593–1606.
DLT-J-2010-HolzerK11 #complexity: The Complexity of Regular(-like) Expressions (MH, MK), pp. 1533–1548.
DLT-J-2010-JiraskovaM11 #complexity #regular expression: Complexity in Union-Free Regular Languages (GJ, TM), pp. 1639–1653.
DLT-J-2010-PribavkinaR11 #complexity: State Complexity of Code Operators (EVP, ER), pp. 1669–1681.
AFL-2011-BrzozowskiJLS #complexity #regular expression: Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.
AFL-2011-BrzozowskiL #complexity: Quotient Complexity of Star-Free Languages (JAB, BL), pp. 138–152.
CIAA-2011-HolzerKM #complexity #nondeterminism: Nondeterministic State Complexity of Star-Free Languages (MH, MK, KM), pp. 178–189.
CIAA-2011-Martyugin #automaton #complexity #problem #word: Complexity of Problems Concerning Reset Words for Cyclic and Eulerian Automata (PM), pp. 238–249.
DLT-2011-BrodaMMR #automaton #complexity: The Average Transition Complexity of Glushkov and Partial Derivative Automata (SB, AM, NM, RR), pp. 93–104.
DLT-2011-BrzozowskiY #complexity: Syntactic Complexity of Ideal and Closed Languages (JAB, YY), pp. 117–128.
DLT-2011-HolzerJ #complexity: Chop Operations and Expressions: Descriptional Complexity Considerations (MH, SJ), pp. 264–275.
DLT-2011-YuG #approximate #complexity #research: State Complexity Research and Approximation (SY, YG), pp. 46–57.
ICALP-v1-2011-BockenhauerKKK #complexity #on the #problem: On the Advice Complexity of the k-Server Problem (HJB, DK, RK, RK), pp. 207–218.
ICALP-v1-2011-ChaillouxKR #complexity #quantum: Quantum Commitments from Complexity Assumptions (AC, IK, BR), pp. 73–85.
ICALP-v1-2011-ElsasserT #complexity: Settling the Complexity of Local Max-Cut (Almost) Completely (RE, TT), pp. 171–182.
ICALP-v1-2011-GuoLV #complexity #problem #symmetry: The Complexity of Symmetric Boolean Parity Holant Problems — (Extended Abstract) (HG, PL, LGV), pp. 712–723.
ICALP-v1-2011-MagniezNSX #bound #complexity #random #recursion: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.
ICALP-v1-2011-Zhang #bound #communication #complexity #on the #power of #quantum: On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.
LATA-2011-BareckaC #automaton #complexity #finite #problem: The Parameterized Complexity of Chosen Problems for Finite Automata on Trees (AB, WC), pp. 129–141.
LATA-2011-ChatterjeeHH #complexity #game studies: The Complexity of Request-Response Games (KC, TAH, FH), pp. 227–237.
LATA-2011-OkhotinS #ambiguity #automaton #complexity #word: Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.
LATA-2011-RigoV #complexity #integer #set: Syntactic Complexity of Ultimately Periodic Sets of Integers (MR, ÉV), pp. 477–488.
LATA-2011-SalomaaSY #complexity: Undecidability of the State Complexity of Composed Regular Operations (AS, KS, SY), pp. 489–498.
SFM-2011-BlairPGG #distributed: Interoperability in Complex Distributed Systems (GSB, MP, PG, NG), pp. 1–26.
CEFP-2011-TothB #erlang #static analysis: Static Analysis of Complex Software Systems Implemented in Erlang (MT, IB), pp. 440–498.
ICFP-2011-Mitchell #ecosystem #functional #modelling #programming: Functional programming through deep time: modeling the first complex ecosystems on earth (EGM), pp. 28–31.
AGTIVE-2011-GreenyerR #automaton #concept #diagrams #game studies #graph grammar #sequence chart #specification: Applying Advanced TGG Concepts for a Complex Transformation of Sequence Diagram Specifications to Timed Game Automata (JG, JR), pp. 222–237.
AGTIVE-2011-Kocsis: Best Practices to Model Business Services in Complex IT Environments (ZK), p. 1.
AGTIVE-2011-Proctor #named: Drools: A Rule Engine for Complex Event Processing (MP), p. 2.
CHI-2011-AragonW #collaboration #distributed: Collaborative creativity: a complex systems model with distributed affect (CRA, AW), pp. 1875–1884.
CHI-2011-VoidaHA #database #information management: Homebrew databases: complexities of everyday information management in nonprofit organizations (AV, EH, BAA), pp. 915–924.
CSCW-2011-BardramD #analysis #process: Activity analysis: applying activity theory to analyze complex work in hospitals (JB, AD), pp. 455–464.
CSCW-2011-BouwerNE #collaboration #navigation #towards: Towards support for collaborative navigation in complex indoor environments (AB, FN, VE), pp. 601–604.
DHM-2011-ZhangWZQL #complexity #fault: Task Complexity Related Training Effects on Operation Error of Spaceflight Emergency Task (YZ, BW, XZ, WQ, ML), pp. 436–445.
DUXU-v2-2011-Albers11a #interactive: Human-Information Interactions with Complex Software (MJA), pp. 245–254.
HCD-2011-AhramK #behaviour #design #modelling #network #social: Social Networking Applications: Smarter Product Design for Complex Human Behaviour Modeling (TZA, WK), pp. 471–480.
HCD-2011-Ciarletta #multi #pervasive: Co-simulation and Multi-models for Pervasive Computing as a Complex System (LC), pp. 197–206.
HCI-DDA-2011-Teixeira-FariaI #abstraction #component #user interface #visual notation: Complex Components Abstraction in Graphical User Interfaces (PMTF, JRI), pp. 309–318.
HCI-MIIE-2011-WangZYZSP #what: Believe What You Hear, Not What You See — Vision Interferes with Auditory Route Guidance in Complex Environment (YW, HZ, LY, KZ, XS, TP), pp. 346–354.
HIMI-v1-2011-OkuboTT #comparison #complexity: Comparison between Mathematical Complexity and Human Feeling (MO, AT, ST), pp. 132–141.
HIMI-v1-2011-ZhouDHY #industrial #interface #tool support: A Human Interface Toolkit for Developing Operation Support System of Complex Industrial Systems with IVI-COM Technology (YZ, YD, XH, HY), pp. 82–89.
IDGD-2011-HwangY #interface #multi: Accommodating Both Expert Users and Novice Users in One Interface by Utilizing Multi-layer Interface in Complex Function Products (TKPH, HYY), pp. 159–165.
IDGD-2011-LiuL #complexity #comprehension #performance #towards: Toward Understanding the Relationship between Task Complexity and Task Performance (PL, ZL), pp. 192–200.
CAiSE-2011-FiglL #complexity #modelling #process: Cognitive Complexity in Business Process Modeling (KF, RL), pp. 452–466.
ICEIS-v1-2011-Cuzzocrea #approach #information management #mining: A UML-extended Approach for Mining OLAP Data Cubes in Complex Knowledge Discovery Environments (AC), pp. 281–289.
ICEIS-v1-2011-LiLC #adaptation #complexity #research: Research on Innovation of Shipbuilding Supply Chain Management based on Complexity Adaptive System (GL, CL, YC), pp. 389–395.
ICEIS-v2-2011-MarquezCCS #approach #distributed #multi #social: A Distributed Agency Methodology Applied to Complex Social Systems — A Multi-Dimensional Approach (BYM, MCP, JRC, EDS), pp. 204–209.
ICEIS-v4-2011-QiWGS #equation: Exact Solutions for the Complex Ginzburg-Landau Equation (PQ, DW, CG, HS), pp. 675–677.
CIKM-2011-HungBS #data transformation: Spreadsheet-based complex data transformation (VH, BB, RSP), pp. 1749–1754.
ECIR-2011-Tjin-Kam-JetTH #web: Free-Text Search versus Complex Web Forms (KTKJ, DT, DH), pp. 670–674.
ICML-2011-LiP #clustering #exclamation: Time Series Clustering: Complex is Simpler! (LL, BAP), pp. 185–192.
KDIR-2011-Dietz #complexity: Intellectually Managing Organized Complexity (JLGD), p. 13.
KEOD-2011-KohnMSL #complexity #ontology: Use of Existing Ontologies as Input for Structural Complexity Management — Reducing the Effort for Analysing and Improving Engineering Systems (AK, MM, HXS, UL), pp. 195–201.
SEKE-2011-GaoGMTBK #analysis #complexity #component #configuration management #modelling #testing: Testing Configurable Component-Based Software — Configuration Test Modeling and Complexity Analysis (JG, JG, AM, CT, XB, DCK), pp. 495–502.
SEKE-2011-MoserWHB #analysis #automation #detection #empirical #requirements #semantics: Automating the Detection of Complex Semantic Conflicts between Software Requirements (An empirical study on requirements conflict analysis with semantic technology) (TM, DW, MH, SB), pp. 729–735.
OOPSLA-2011-PintoDDGW #abstraction #concurrent: A simple abstraction for complex concurrent indexes (PdRP, TDY, MD, PG, MJW), pp. 845–864.
GPCE-2011-SobernigGSZ #api #complexity #design #empirical #framework #integration: Comparing complexity of API designs: an exploratory experiment on DSL-based framework integration (SS, PG, MS, UZ), pp. 157–166.
LOPSTR-2011-StroderESGF #analysis #complexity #linear #prolog #semantics #termination: A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog (TS, FE, PSK, JG, CF), pp. 237–252.
PPDP-2011-ColazzoS #complexity #precise #type inference #xquery: Precision and complexity of XQuery type inference (DC, CS), pp. 89–100.
POPL-2011-EsparzaG #complexity #parallel #source code #thread #verification: Complexity of pattern-based verification for multithreaded programs (JE, PG), pp. 499–510.
REFSQ-2011-WnukRB #challenge #complexity #development #requirements #scalability: Scaling Up Requirements Engineering — Exploring the Challenges of Increasing Size and Complexity in Market-Driven Software Development (KW, BR, BB), pp. 54–59.
SAC-2011-CederquistD #complexity #constraints: Complexity of fairness constraints for the Dolev-Yao attacker model (JC, MTD), pp. 1502–1509.
SAC-2011-CuzzocreaS #clustering #database #framework #mining #named: ClustCube: an OLAP-based framework for clustering and mining complex database objects (AC, PS), pp. 976–982.
SAC-2011-LiuS: Tracking continuous topological changes of complex moving regions (HL, MS), pp. 833–838.
SAC-2011-LuKNB #analysis #approach #embedded #realtime #simulation #statistics #validation: A statistical approach to simulation model validation in response-time analysis of complex real-time embedded systems (YL, JK, TN, IB), pp. 711–716.
SAC-2011-Sanchez-GonzalezRGC #complexity #control flow #metric #modelling #towards: Towards thresholds of control flow complexity measures for BPMN models (LSG, FR, FG, JC), pp. 1445–1450.
SLE-2011-VermolenWV #evolution #metamodelling: Reconstructing Complex Metamodel Evolution (SV, GW, EV), pp. 201–221.
PLEASE-2011-Livengood #evolution #modelling #product line #variability: Issues in software product line evolution: complex changes in variability models (SL), pp. 6–9.
SPLC-2011-DordowskyBT #implementation #product line: Implementing a Software Product Line for a Complex Avionics System (FD, RB, HT), pp. 241–250.
HPCA-2011-FallinCM #named: CHIPPER: A low-complexity bufferless deflection router (CF, CC, OM), pp. 144–155.
HPCA-2011-SampsonVGGST #performance: Efficient complex operators for irregular codes (JS, GV, NGH, SG, SS, MBT), pp. 491–502.
LCTES-2011-GrayA #api #architecture #embedded #manycore: Targeting complex embedded architectures by combining the multicore communications API (mcapi) with compile-time virtualisation (IG, NCA), pp. 51–60.
CADE-2011-FredriksonCJ #algorithm #analysis #approximate #behaviour #complexity: Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (MF, MC, SJ), pp. 252–267.
CADE-2011-NoschinskiEG #analysis #complexity #dependence #framework #term rewriting: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems (LN, FE, JG), pp. 422–438.
CSL-2011-DurandS #complexity #higher-order #logic #problem #query: Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.
CSL-2011-LeCY #complexity #formal method #problem: A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem (DTML, SAC, YY), pp. 381–395.
CSL-2011-SchnablS #complexity #runtime: The Exact Hardness of Deciding Derivational and Runtime Complexity (AS, JGS), pp. 481–495.
ICLP-2011-ChristiansenHLP #analysis #network #sequence: Bayesian Annotation Networks for Complex Sequence Analysis (HC, CTH, OTL, MP), pp. 220–230.
ICLP-J-2011-GebserKS #optimisation #programming #set: Complex optimization in answer set programming (MG, RK, TS), pp. 821–839.
LICS-2011-GollerL #complexity #term rewriting #verification: The Complexity of Verifying Ground Tree Rewrite Systems (SG, AWL), pp. 279–288.
LICS-2011-HerrmannZ #complexity #quantum #satisfiability: Computational Complexity of Quantum Satisfiability (CH, MZ), pp. 175–184.
LICS-2011-KontinenKLV #complexity #dependence #logic: Complexity of Two-Variable Dependence Logic and IF-Logic (JK, AK, PL, JV), pp. 289–298.
LICS-2011-Krokhin #complexity #first-order: The Complexity of Evaluating First-Order Sentences over a Fixed Structure (AAK), p. 331.
LICS-2011-Marion #analysis #complexity #type system: A Type System for Complexity Flow Analysis (JYM), pp. 123–132.
LICS-2011-Pitassi #bibliography #complexity #proving #state of the art: Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results (TP), p. 119.
RTA-2011-MoserS #complexity #dependence #framework #multi #proving #recursion #termination: Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity (GM, AS), pp. 235–250.
SAT-2011-BeyersdorffGL #complexity: Parameterized Complexity of DPLL Search Procedures (OB, NG, ML), pp. 5–18.
SAT-2011-Williams #algorithm #bound #complexity #satisfiability: Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.
ECSA-2010-ZalewskiK #architecture #complexity: Architecture Decision-Making in Support of Complexity Control (AZ, SK), pp. 501–504.
QoSA-2010-MeedeniyaBAG #architecture #embedded #energy #optimisation #reliability: Architecture-Driven Reliability and Energy Optimization for Complex Embedded Systems (IM, BB, AA, LG), pp. 52–67.
CASE-2010-DriesselHMS #architecture #assessment #heuristic #parallel #performance #scheduling: A parallel shifting bottleneck heuristic for scheduling complex job shops: Architecture and performance assessment (RD, UH, LM, WS), pp. 81–86.
CASE-2010-NazeemR #approach #design #resource management: A practical approach to the design of maximally permissive liveness-enforcing supervisors for complex resource allocation systems (AN, SR), pp. 451–458.
CASE-2010-PintoKK #analysis #modelling #probability: A model-based end-to-end toolchain for the probabilistic analysis of complex systems (AP, SK, SK), pp. 994–1000.
DAC-2010-YangLW #complexity #fault #named: ECR: a low complexity generalized error cancellation rewiring scheme (XY, TKL, YLW), pp. 511–516.
DATE-2010-CupaiuoloST #architecture #detection #ml #throughput: Low-complexity high throughput VLSI architecture of soft-output ML MIMO detector (TC, MS, AT), pp. 1396–1401.
DATE-2010-Diekhoff: AUTOSAR basic software for complex control units (DD), pp. 263–266.
DATE-2010-MaricauG #complexity #reliability #simulation #variability: Variability-aware reliability simulation of mixed-signal ICs with quasi-linear complexity (EM, GGEG), pp. 1094–1099.
DATE-2010-ShafiqueMH #adaptation #complexity #reduction #using #video: An HVS-based Adaptive Computational Complexity Reduction Scheme for H.264/AVC video encoder using Prognostic Early Mode Exclusion (MS, BM, JH), pp. 1713–1718.
PODS-2010-Jayram #complexity #tutorial: Information complexity: a tutorial (TSJ), pp. 159–168.
PODS-2010-MartensNS #complexity #design #repository #xml: Schema design for XML repositories: complexity and tractability (WM, MN, TS), pp. 239–250.
SIGMOD-2010-FontouraSSVVVZ: Efficiently evaluating complex boolean expressions (MF, SS, JS, SV, EV, SV, JYZ), pp. 3–14.
SIGMOD-2010-TerwilligerBU #automation #database #evolution #modelling: Worry-free database upgrades: automated model-driven evolution of schemas and complex mappings (JFT, PAB, AU), pp. 1191–1194.
VLDB-2010-DeutchGM #navigation: Navigating in Complex Mashed-Up Applications (DD, OG, TM), pp. 320–329.
VLDB-2010-DongBHS #detection: Global Detection of Complex Copying Relationships Between Sources (XD, LBE, YH, DS), pp. 1358–1369.
VLDB-2010-WangREW #health #realtime: Active Complex Event Processing: Applications in Real-Time Health Care (DW, EAR, RTE, HW), pp. 1545–1548.
VLDB-2010-WoodsTA #detection: Complex Event Detection at Wire Speed with FPGAs (LW, JT, GA), pp. 660–669.
VLDB-2011-MeliouGMS #complexity #query: The Complexity of Causality and Responsibility for Query Answers and non-Answers (AM, WG, KFM, DS), pp. 34–45.
FoSSaCS-2010-CassezMZ #complexity #data flow #security: The Complexity of Synchronous Notions of Information Flow Security (FC, RvdM, CZ), pp. 282–296.
ICPC-2010-BeyerF #dependence #detection #low level #named: DepDigger: A Tool for Detecting Complex Low-Level Dependencies (DB, AF), pp. 40–41.
ICPC-2010-BeyerF10b #dependence #effectiveness #low level: A Simple and Effective Measure for Complex Low-Level Dependencies (DB, AF), pp. 80–83.
ICPC-2010-BouwersVLD #architecture #complexity: A Cognitive Model for Software Architecture Complexity (EB, JV, CL, AvD), pp. 152–155.
ICSM-2010-PreteRSK #re-engineering #refactoring: Template-based reconstruction of complex refactorings (KP, NR, NS, MK), pp. 1–10.
SAS-2010-AliasDFG #bound #complexity #multi #ranking #source code #termination: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (CA, AD, PF, LG), pp. 117–133.
SAS-2010-McCloskeyRS #array #invariant: Statically Inferring Complex Heap, Array, and Numeric Invariants (BM, TWR, MS), pp. 71–99.
STOC-2010-BeameHP #complexity #proving: Hardness amplification in proof complexity (PB, TH, TP), pp. 87–96.
STOC-2010-DyerR #complexity #csp #on the: On the complexity of #CSP (MED, DR), pp. 725–734.
STOC-2010-GoyalJ #complexity #on the: On the round complexity of covert computation (VG, AJ), pp. 191–200.
STOC-2010-KawamuraC #analysis #complexity: Complexity theory for operators in analysis (AK, SAC), pp. 495–502.
STOC-2010-PaturiP #complexity #on the #satisfiability: On the complexity of circuit satisfiability (RP, PP), pp. 241–250.
FLOPS-2010-AvanziniM #analysis #complexity #graph grammar: Complexity Analysis by Graph Rewriting (MA, GM), pp. 257–271.
DLT-J-2008-Ada10 #communication #complexity #nondeterminism #on the #regular expression: On the Non-Deterministic Communication Complexity of Regular Languages (AA), pp. 479–493.
DLT-J-2008-BassinoGN10 #complexity #finite: The Average State Complexity of Rational Operations on Finite Languages (FB, LG, CN), pp. 495–516.
CIAA-2010-CuiGKY #complexity: State Complexity of Catenation Combined with Union and Intersection (BC, YG, LK, SY), pp. 95–104.
CIAA-2010-DiekertK #complexity #regular expression: Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (VD, SK), pp. 105–114.
DLT-2010-HolzerK #complexity: The Complexity of Regular(-Like) Expressions (MH, MK), pp. 16–30.
DLT-2010-JiraskovaM #complexity #regular expression: Complexity in Union-Free Regular Languages (GJ, TM), pp. 255–266.
DLT-2010-PribavkinaR #complexity #regular expression: State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages (EVP, ER), pp. 376–386.
ICALP-v1-2010-BeimelDKW #communication #complexity: Choosing, Agreeing, and Eliminating in Communication Complexity (AB, SBD, EK, EW), pp. 451–462.
ICALP-v1-2010-CaiCL #graph #morphism #theorem: Graph Homomorphisms with Complex Values: A Dichotomy Theorem (JyC, XC, PL), pp. 275–286.
ICALP-v1-2010-DellHW #complexity #exponential #polynomial: Exponential Time Complexity of the Permanent and the Tutte Polynomial (HD, TH, MW), pp. 426–437.
ICALP-v1-2010-JacobsCLM #complexity #on the: On the Complexity of Searching in Trees: Average-Case Minimization (TJ, FC, ESL, MM), pp. 527–539.
ICALP-v1-2010-LeeZ #communication #complexity #composition #theorem: Composition Theorems in Communication Complexity (TL, SZ), pp. 475–489.
ICALP-v2-2010-BlockiW #complexity #privacy #problem: Resolving the Complexity of Some Data Privacy Problems (JB, RW), pp. 393–404.
LATA-2010-AravantinosCP #complexity #problem #satisfiability: Complexity of the Satisfiability Problem for a Class of Propositional Schemata (VA, RC, NP), pp. 58–69.
LATA-2010-Brzozowski #complexity: Complexity in Convex Languages (JAB), pp. 1–15.
LATA-2010-Lin #calculus #complexity: Modal Nonassociative Lambek Calculus with Assumptions: Complexity and Context-Freeness (ZL0), pp. 414–425.
LATA-2010-SaeedloeiG #induction #realtime #verification: Verifying Complex Continuous Real-Time Systems with Coinductive CLP(R) (NS, GG), pp. 536–548.
LATA-2010-Zantema #complexity: Complexity of Guided Insertion-Deletion in RNA-Editing (HZ), pp. 608–619.
IFM-2010-FaberIJS #automation #parametricity #specification #verification: Automatic Verification of Parametric Specifications with Complex Topologies (JF, CI, SJ, VSS), pp. 152–167.
CHI-2010-ChilanaWK #comprehension #usability: Understanding usability practices in complex domains (PKC, JOW, AJK), pp. 2337–2346.
SOFTVIS-2010-TrumperBD #comprehension #parallel #thread #using #visualisation: Understanding complex multithreaded software systems by using trace visualization (JT, JB, JD), pp. 133–142.
CAiSE-2010-BlancoCMP #data flow #modelling #probability: Probabilistic Models to Reconcile Complex Data from Inaccurate Data Sources (LB, VC, PM, PP), pp. 83–97.
CAiSE-2010-SenS #lifecycle #named: GRUVe: A Methodology for Complex Event Pattern Life Cycle Management (SS, NS), pp. 209–223.
ICEIS-AIDSS-2010-SantosBC #composition #concept #named #ontology #plugin: FONTE — A Protégé Plugin for Engineering Complex Ontologies by Assembling Modular Ontologies of Space, Time and Domain Concepts (JS, LB, AGC), pp. 93–102.
ICEIS-AIDSS-2010-TroianoP #complexity #modelling: Supporting Complexity in Modeling Bayesian Troubleshooting (LT, DDP), pp. 344–349.
ICEIS-ISAS-2010-CuzzocreaLI #information management #modelling: A Process-driven Methodology for Modeling Service-oriented Complex Information Systems (AC, ADL, SI), pp. 390–398.
ICEIS-ISAS-2010-DohringKGZ #architecture #challenge #convergence #workflow: The Convergence of Workflows, Business Rules and Complex Events — Defining a Reference Architecture and Approaching Realization Challenges (MD, LK, EG, BZ), pp. 338–343.
ICEIS-ISAS-2010-KikuchiMAM #mining #process: Process Mining for Job Nets in Integrated Complex Computer Systems (SK, YM, MA, SM), pp. 5–12.
ICEIS-J-2010-SantosBC10a #named #ontology #plugin: FONTE: A Protégé Plug-in for Engineering Complex Ontologies (JS, LB, AGC), pp. 222–236.
ICML-2010-SzitaS #bound #complexity #learning #modelling: Model-based reinforcement learning with nearly tight exploration complexity bounds (IS, CS), pp. 1031–1038.
ICPR-2010-AkcayAS #segmentation: Hierarchical Segmentation of Complex Structures (HGA, SA, PS), pp. 1120–1123.
ICPR-2010-BushraOEO #detection #linear: QRS Complex Detection by Non Linear Thresholding of Modulus Maxima (BJ, OB, EF, OL), pp. 4500–4503.
ICPR-2010-DengH #composition #detection #exponential #process: Voice Activity Detection Based on Complex Exponential Atomic Decomposition and Likelihood Ratio Test (SD, JH), pp. 89–92.
ICPR-2010-EscolanoLH #complexity #network: Heat Flow-Thermodynamic Depth Complexity in Networks (FE, MAL, ERH), pp. 1578–1581.
ICPR-2010-KumarCCAPH #classification #complexity #using: Heart Murmur Classification Using Complexity Signatures (DK, PC, RC, MA, RPP, JH), pp. 2564–2567.
ICPR-2010-LiuWZ: Extracting Captions in Complex Background from Videos (XL, WW, TZ), pp. 3232–3235.
ICPR-2010-OnishiY #visualisation: Visualization of Customer Flow in an Office Complex over a Long Period (MO, IY), pp. 1747–1750.
ICPR-2010-SuLT #image #robust: Robust Fourier-Based Image Alignment with Gradient Complex Image (HRS, SHL, YHT), pp. 2378–2381.
KDIR-2010-Diday #data analysis: Extracting Knowledge from Complex Data by Symbolic Data Analysis (ED), pp. 5–6.
KDIR-2010-OzekiKT #analysis #multi #network: Multi-modal Analysis of Complex Network — Point Stimulus Response Depending on Its Location in the Network (TO, TK, YT), pp. 226–231.
KEOD-2010-AustingH #complexity #metric #modelling: Complexity Measurement of Product Models (SgA, AH), pp. 404–407.
KR-2010-CreignouST #abduction #complexity #set #strict: Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).
KR-2010-Li #graph #representation: A Layered Graph Representation for Complex Regions (SL).
KR-2010-PenalozaS #axiom #complexity #logic #on the #product line: On the Complexity of Axiom Pinpointing in the EL Family of Description Logics (RP, BS).
SEKE-2010-LeeSB #complexity #information management #legacy #visualisation: Knowledge Engineering to Visualize Complexity for Legacy Modernization Planning (SBL, SGS, KSB), pp. 331–334.
SEKE-2010-MoserDB #automation #generative #ontology #simulation #testing: Ontology-Based Test Case Generation For Simulating Complex Production Automation Systems (TM, GD, SB), pp. 478–482.
SEKE-2010-YastrebenetskyT #complexity #metric: Synchronization Complexity Metric (PY, MT), pp. 147–152.
SIGIR-2010-Fang #information management #network: Entity information management in complex networks (YF), p. 917.
PPDP-2010-TekleL #analysis #complexity #datalog #performance #precise #query: Precise complexity analysis for efficient datalog queries (KTT, YAL), pp. 35–44.
POPL-2010-SchaferM #datalog #type inference: Type inference for datalog with complex type hierarchies (MS, OdM), pp. 145–156.
REFSQ-2010-BittnerRW #case study #multi #product line #requirements: A Case Study on Tool-Supported Multi-level Requirements Management in Complex Product Families (MB, MOR, MW), pp. 173–187.
SAC-2010-CeciALM #approach #data mining #mining #ranking #relational: Complex objects ranking: a relational data mining approach (MC, AA, CL, DM), pp. 1071–1077.
SAC-2010-ChowdhuryZ #complexity #metric #question: Can complexity, coupling, and cohesion metrics be used as early indicators of vulnerabilities? (IC, MZ), pp. 1963–1969.
SAC-2010-EcksteinHW #approach #multi #named #visual notation: LFRP-search: multi-layer ranked visual faceted search: an approach to cope with complex search situations (RE, AH, NW), pp. 1713–1717.
SAC-2010-MigotinaRF #automation #detection #fuzzy #parametricity #using: Automatic K-complex detection using Hjorth parameters and fuzzy decision (DM, ACR, ALNF), pp. 979–980.
SAC-2010-WangLRKL #distributed #information management: Improving complex distributed software system availability through information hiding (LW, YL, SR, KAK, XL), pp. 452–456.
FSE-2010-Eagle #big data #development #social: Big data, global development, and complex social systems (NE), pp. 3–4.
FSE-2010-LiuSD #realtime: Analyzing hierarchical complex real-time systems (YL, JS, JSD), pp. 365–366.
ICSE-2010-Padua #complexity #effectiveness #performance: Measuring complexity, effectiveness and efficiency in software course projects (WP), pp. 545–554.
LDTA-2010-Giavitto #domain-specific language #simulation: A domain specific language for complex natural and artificial systems simulations (JLG), p. 1.
CSL-2010-EickmeyerG #complexity: Randomisation and Derandomisation in Descriptive Complexity Theory (KE, MG), pp. 275–289.
CSL-2010-LohmannV #complexity #dependence #logic: Complexity Results for Modal Dependence Logic (PL, HV), pp. 411–425.
CSL-2010-MartinM #complexity #first-order #logic #similarity: The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case (BM, JM), pp. 426–438.
ICST-2010-EldhBSHP #automation #scalability #towards: Towards Fully Automated Test Management for Large Complex Systems (SE, JB, MS, HH, SP), pp. 412–420.
IJCAR-2010-Benthem #complexity #logic: Logic between Expressivity and Complexity (JvB), pp. 122–126.
IJCAR-2010-Kazakov #axiom #logic: An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ (YK), pp. 472–486.
LICS-2010-KopczynskiT #complexity #image: Parikh Images of Grammars: Complexity and Applications (EK, AWT), pp. 80–89.
LICS-2010-KreutzerT #bound #complexity #higher-order #logic #monad: Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.
RTA-2010-AvanziniM #complexity #runtime: Closing the Gap Between Runtime Complexity and Polytime Computability (MA, GM), pp. 33–48.
RTA-2010-ZanklK #analysis #complexity #composition: Modular Complexity Analysis via Relative Complexity (HZ, MK), pp. 385–400.
SAT-2010-BeyersdorffMMTV #complexity #logic #proving: Proof Complexity of Propositional Default Logic (OB, AM, SM, MT, HV), pp. 30–43.
SAT-2010-Paturi #algorithm #complexity: Exact Algorithms and Complexity (RP), pp. 8–9.
SAT-2010-PorschenSS #complexity #linear #problem: Complexity Results for Linear XSAT-Problems (SP, TS, ES), pp. 251–263.
VMCAI-2010-ChadhaLPV #bound #complexity #realtime #verification: Complexity Bounds for the Verification of Real-Time Software (RC, AL, PP, MV), pp. 95–111.
WICSA-ECSA-2009-AriasAA #execution #scalability: Defining execution viewpoints for a large and complex software-intensive system (TBCA, PA, PA), pp. 1–10.
WICSA-ECSA-2009-SangwanN #architecture #complexity: Characterizing essential and incidental complexity in software architectures (RSS, CJN), pp. 265–268.
ASE-2009-LiXTHS #automation #generative #named #regular expression #source code #testing #using: Reggae: Automated Test Generation for Programs Using Complex Regular Expressions (NL, TX, NT, JdH, WS), pp. 515–519.
CASE-2009-RamanathanRR #traceability: Achieving “handoff” traceability of complex system improvement (JR, RR, SR), pp. 641–646.
DAC-2009-Anderson #complexity #design #risk management: Beyond innovation: dealing with the risks and complexity of processor design in 22nm (CJA), p. 103.
DAC-2009-ChaiJK #3d #complexity #equation #linear #scalability: A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction (WC, DJ, CKK), pp. 752–757.
DAC-2009-SiegelMP #debugging #performance: Untwist your brain: efficient debugging and diagnosis of complex assertions (MS, AM, CP), pp. 644–647.
DAC-2009-YagiREAVS #design: The wild west: conquest of complex hardware-dependent software design (HY, WR, JE, JA, KAV, MS), pp. 878–879.
DAC-2009-YanVC #scalability: Handling complexities in modern large-scale mixed-size placement (JZY, NV, CC), pp. 436–441.
DATE-2009-BonnaudS #design: Cross-coupling in 65nm fully integrated EDGE System On Chip Design and cross-coupling prevention of complex 65nm SoC (PHB, GS), pp. 1045–1050.
ICDAR-2009-BenjelilKMA09a #documentation #image #segmentation: Steerable Pyramid Based Complex Documents Images Segmentation (MB, SK, RM, AMA), pp. 833–837.
ICDAR-2009-HanifP #algorithm #detection #image #locality #using: Text Detection and Localization in Complex Scene Images using Constrained AdaBoost Algorithm (SMH, LP), pp. 1–5.
ICDAR-2009-SunK #detection #embedded: Detecting Printed and Handwritten Partial Copies of Line Drawings Embedded in Complex Backgrounds (WS, KK), pp. 341–345.
PODS-2009-Parys #complexity #evaluation #linear #polynomial #xpath: XPath evaluation in linear time with polynomial combined complexity (PP), pp. 55–64.
SIGMOD-2009-ChenGDYR #evolution #optimisation #source code: Optimizing complex extraction programs over evolving text data (FC, BJG, AD, JY, RR), pp. 321–334.
ITiCSE-2009-ErkanNO #network #replication #research: Exposure to research through replication of research: a case in complex networks (AE, SN, NO), pp. 114–118.
TACAS-2009-FarzanM #complexity #predict: The Complexity of Predicting Atomicity Violations (AF, PM), pp. 155–169.
ICPC-J-2008-HindleGH09 #complexity #rank #using: Reading beside the lines: Using indentation to rank revisions by complexity (AH, MWG, RCH), pp. 414–429.
CSMR-2009-CapiluppiB #case study #complexity: Structural Complexity and Decay in FLOSS Systems: An Inter-repository Study (AC, KB), pp. 169–178.
CSMR-2009-Lilienthal #architecture #complexity #scalability: Architectural Complexity of Large-Scale Software Systems (CL), pp. 17–26.
ICSM-2009-WangWYZY #evolution #kernel #linux #network #novel: Linux kernels as complex networks: A novel method to study evolution (LW, ZW, CY, LZ, QY), pp. 41–50.
WCRE-1999-AriasAA99a #resource management #scalability: Constructing a Resource Usage View of a Large and Complex Software-Intensive System (TBCA, PA, PA), pp. 247–255.
SAS-2009-SridharanF #analysis #complexity: The Complexity of Andersen’s Analysis in Practice (MS, SJF), pp. 205–221.
STOC-2009-DworkNRRV #algorithm #complexity #on the #performance: On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.
STOC-2009-KushilevitzW #communication #complexity #on the: On the complexity of communication complexity (EK, EW), pp. 465–474.
CIAA-J-2008-HolzerK09 #automaton #complexity #finite #nondeterminism: Nondeterministic Finite Automata — Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 563–580.
DLT-2009-BlakeleyBGR #complexity #on the #set #word: On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.
DLT-2009-DurandP #complexity: Asymptotic Cellular Complexity (BD, VP), pp. 195–206.
DLT-2009-GruberH #bound #complexity #regular expression: Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.
DLT-2009-Kapoutsis #automaton #complexity #finite: Size Complexity of Two-Way Finite Automata (CAK), pp. 47–66.
DLT-2009-Saarela #complexity #equation #on the #satisfiability #theorem: On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (AS), pp. 443–453.
ICALP-v1-2009-AroraSW #case study #graph #towards: Towards a Study of Low-Complexity Graphs (SA, DS, AW), pp. 119–131.
ICALP-v1-2009-ChandranGR #complexity #linear: The Tile Complexity of Linear Assemblies (HC, NG, JHR), pp. 235–253.
ICALP-v1-2009-DraismaKW #communication #complexity #multi: Partition Arguments in Multiparty Communication Complexity (JD, EK, EW), pp. 390–402.
ICALP-v1-2009-DurandRS #complexity #fault: High Complexity Tilings with Sparse Errors (BD, AER, AS), pp. 403–414.
ICALP-v1-2009-RolandS #communication #complexity: Amortized Communication Complexity of Distributions (JR, MS), pp. 738–749.
ICALP-v2-2009-KobayashiO #calculus #complexity #model checking #recursion #μ-calculus: Complexity of Model Checking Recursion Schemes for Fragments of the Modal μ-Calculus (NK, CHLO), pp. 223–234.
ICALP-v2-2009-UmmelsW #complexity #game studies #multi #nash #probability: The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (MU, DW), pp. 297–308.
LATA-2009-BeyersdorffKM #complexity #nondeterminism #proving: Nondeterministic Instance Complexity and Proof Systems with Advice (OB, JK, SM), pp. 164–175.
LATA-2009-Bollig #bound #complexity #integer #multi: Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (BB), pp. 212–223.
LATA-2009-HanSY #complexity #regular expression: State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
LATA-2009-HolzerK #automaton #complexity #finite: Descriptional and Computational Complexity of Finite Automata (MH, MK), pp. 23–42.
LATA-2009-LiuM #automation #complexity: Analysing Complexity in Classes of Unary Automatic Structures (JL, MM), pp. 518–529.
LATA-2009-Llull-ChavarriaV #complexity #semantics #word: An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words (JLC, OV), pp. 530–541.
LATA-2009-LopatkovaH #segmentation: Segmentation Charts for Czech — Relations among Segments in Complex Sentences (ML, TH), pp. 542–553.
LATA-2009-Salimov #complexity #infinity #word: Constructing Infinite Words of Intermediate Arithmetical Complexity (PVS), pp. 696–701.
LATA-2009-Salomaa #automaton #complexity #word: State Complexity of Nested Word Automata (KS), pp. 59–70.
FM-2009-BonakdarpourK #bound #complexity #on the: On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery (BB, SSK), pp. 660–675.
CEFP-2009-KoopmanPA #consistency #effectiveness #semantics: An Effective Methodology for Defining Consistent Semantics of Complex Systems (PWMK, RP, PA), pp. 224–267.
CHI-2009-MentisBHRC #development: Development of decision rationale in complex group decision making (HMM, PMB, BH, MBR, JMC), pp. 1341–1350.
DHM-2009-BensonR #complexity: Complexity of Sizing for Space Suit Applications (EB, SR), pp. 599–607.
DHM-2009-YangFKXR: Joint Coupling for Human Shoulder Complex (JY, XF, JHK, YX, SR), pp. 72–81.
HCD-2009-JarrettQRAS #analysis #development #metric #testing #usability #using #web: Using Measurements from Usability Testing, Search Log Analysis and Web Traffic Analysis to Inform Development of a Complex Web Site Used for Complex Tasks (CJ, WQ, IR, SA, VS), pp. 729–738.
HCI-NIMT-2009-PantforderVS #3d #evaluation #interactive #problem #process #visualisation: Benefit and Evaluation of Interactive 3D Process Data Visualization for the Presentation of Complex Problems (DP, BVH, KS), pp. 869–878.
HCI-VAD-2009-KandoganHBM #collaboration #risk management: Studying Reactive, Risky, Complex, Long-Spanning, and Collaborative Work: The Case of IT Service Delivery (EK, EMH, JHB, PPM), pp. 504–513.
HIMI-DIE-2009-SamoylovFRTSG #communication #interactive: Tactical Access to Complex Technology through Interactive Communication (TACTIC) (AS, CF, SHR, PDT, KS, PG), pp. 154–162.
ICEIS-DISI-2009-Daute #approach #database #maintenance #realtime: Introducing Real-time Business Case Database — An Approach to Improve System Maintenance of Complex Application Landscapes (OD), pp. 202–207.
ICEIS-HCI-2009-NakanishiTO #artificial reality #complexity #design #effectiveness #guidelines #using #verification: Study for Establishing Design Guidelines for Manuals using Augmented Reality Technology — Verification and Expansion of the Basic Model Describing “Effective Complexity” (MN, SiT, YO), pp. 21–26.
CIKM-2009-WangZZ09a #information management #network: Bridging the gap: complex networks meet information and knowledge management (JW, SZ, DZ), pp. 2113–2114.
ICML-2009-BurlW #learning: Active learning for directed exploration of complex systems (MCB, EW), pp. 89–96.
ICML-2009-NeumannMP #learning: Learning complex motions by sequencing simpler motion templates (GN, WM, JP), pp. 753–760.
ICML-2009-ZhangSFD #learning: Learning non-redundant codebooks for classifying complex objects (WZ, AS, XF, TGD), pp. 1241–1248.
KDIR-2009-Ivanko #complexity: A Simple Measure of the Kolmogorov Complexity (EI), pp. 5–9.
KEOD-2009-AnderlMS #approach #complexity #optimisation #reduction: An Approach to Support Interdisciplinary Variant Diversity Optimization — Planning Variant Diversity — Beyond Complexity Reduction (RA, SM, DS), pp. 408–411.
SIGIR-2009-VillaCJJ #interface: An aspectual interface for supporting complex search tasks (RV, IC, HJ, JMJ), pp. 379–386.
MoDELS-2009-JohannesZFCKP #composition: Abstracting Complex Languages through Transformation and Composition (JJ, SZ, MAF, AC, DSK, RFP), pp. 546–550.
MoDELS-2009-JohannesZFCKP #composition: Abstracting Complex Languages through Transformation and Composition (JJ, SZ, MAF, AC, DSK, RFP), pp. 546–550.
POPL-2009-GulwaniMC #complexity #estimation #named #performance #precise: SPEED: precise and efficient static estimation of program computational complexity (SG, KKM, TMC), pp. 127–139.
SAC-2009-KerschbaumDSB #communication #complexity #multi #on the #protocol: On the practical importance of communication complexity for secure multi-party computation protocols (FK, DD, AS, DB), pp. 2008–2015.
SAC-2009-LiuTS #classification #complexity #learning #using: Assessing complexity of service-oriented computing using learning classifier systems (LL, ST, HS), pp. 2170–2171.
SAC-2009-Stanclova #complexity #on the: On the complexity of hierarchical associative memories (JS), pp. 908–913.
ICSE-2009-BurnimJS #automation #complexity #generative #named #testing #worst-case: WISE: Automated test generation for worst-case complexity (JB, SJ, KS), pp. 463–473.
ICSE-2009-Hassan #complexity #fault #predict #using: Predicting faults using the complexity of code changes (AEH), pp. 78–88.
SPLC-2009-DordowskyH #product line: Adopting software product line principles to manage software variants in a complex avionics system (FD, WH), pp. 265–274.
CADE-2009-EndrullisGH #complexity: Complexity of Fractran and Productivity (JE, CG, DH), pp. 371–387.
CADE-2009-LahiriQ #abstraction #algorithm #complexity: Complexity and Algorithms for Monomial and Clausal Predicate Abstraction (SKL, SQ), pp. 214–229.
CAV-2009-Gulwani #analysis #bound #complexity #named: SPEED: Symbolic Complexity Bound Analysis (SG), pp. 51–62.
CSL-2009-Weber #complexity #logic #on the: On the Complexity of Branching-Time Logics (VW), pp. 530–545.
ICLP-2009-Sneyers #compilation #complexity #constraints #optimisation: Optimizing Compilation and Computational Complexity of Constraint Handling Rules (JS), pp. 494–498.
ICST-2009-SiddiquiK #generative #named #parallel #testing: PKorat: Parallel Generation of Structurally Complex Test Inputs (JHS, SK), pp. 250–259.
LICS-2009-BulatovM #complexity #constraints: The Complexity of Global Cardinality Constraints (AAB, DM), pp. 419–428.
LICS-2009-DurandHN #complexity: Trichotomy in the Complexity of Minimal Inference (AD, MH, GN), pp. 387–396.
LICS-2009-GollerMT #complexity #on the #process #verification: On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.
LICS-2009-KazakovP #complexity #logic #problem #satisfiability: A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics (YK, IPH), pp. 407–416.
LICS-2009-MadelaineM #complexity #first-order #logic #similarity: The Complexity of Positive First-order Logic without Equality (FRM, BM), pp. 429–438.
RTA-2009-MoserS #complexity #dependence: The Derivational Complexity Induced by the Dependency Pair Method (GM, AS), pp. 255–269.
SAT-2009-BeyersdorffMTV #complexity #logic #reasoning: The Complexity of Reasoning for Fragments of Default Logic (OB, AM, MT, HV), pp. 51–64.
SAT-2009-Szeider #complexity #satisfiability: The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (SS), pp. 276–283.
TLCA-2009-WilkenW #complexity: Complexity of Gödel’s T in λ-Formulation (GW, AW), pp. 386–400.
ECSA-2008-MakkiBG #architecture #automation #multi #process #trade-off: Automating Architecture Trade-Off Decision Making through a Complex Multi-attribute Decision Process (MM, EB, AAG), pp. 264–272.
CASE-2008-LiMAM #multi #network #scheduling: Low-complexity Channel-Aware Scheduling for multichannel wireless local area networks (YL, SM, PA, SFM), pp. 133–138.
DAC-2008-KuehlmannBCRMN #verification: Verifying really complex systems: on earth and beyond (AK, AB, DEC, RAR, RMM, AN), pp. 552–553.
DATE-2008-LeppeltB #complexity: Determining the Technical Complexity of Integrated Circuits (PL, EB), p. 935.
DATE-2008-MoserTBB #complexity #robust: Robust and Low Complexity Rate Control for Solar Powered Sensors (CM, LT, DB, LB), pp. 230–235.
DATE-2008-RoginKFDR #automation #design #generative #hardware: Automatic Generation of Complex Properties for Hardware Designs (FR, TK, GF, RD, SR), pp. 545–548.
DATE-2008-ScheerSB #complexity #reduction #standard: CARbridge, Reduction of System Complexity by Standardisation of the System-Basis-Chips for Automotive Applications (PS, ES, SB), pp. 1107–1110.
PODS-2008-FanGGNP #complexity #composition #web #web service: Complexity and composition of synthesized web services (WF, FG, WG, FN, AP), pp. 231–240.
PODS-2008-SenellartG #complexity #database #on the: On the complexity of deriving schema mappings from database instances (PS, GG), pp. 23–32.
SIGMOD-2008-CaoDCT #multi #optimisation #query: Optimizing complex queries with multiple relation instances (YC, GCD, CYC, KLT), pp. 525–538.
SIGMOD-2008-GolenbergKS #graph #keyword #proximity: Keyword proximity search in complex data graphs (KG, BK, YS), pp. 927–940.
VLDB-2008-AkdereCT #detection #distributed: Plan-based complex event detection across distributed sources (MA, UÇ, NT), pp. 66–77.
FoSSaCS-2008-AntonikHLNW #complexity #problem #specification: Complexity of Decision Problems for Mixed and Modal Specifications (AA, MH, KGL, UN, AW), pp. 112–126.
FoSSaCS-2008-Bozzelli #complexity #linear: The Complexity of CTL* + Linear Past (LB), pp. 186–200.
FoSSaCS-2008-GruberJ #bound #communication #complexity #regular expression #using: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
FoSSaCS-2008-Ummels #complexity #game studies #infinity #multi #nash: The Complexity of Nash Equilibria in Infinite Multiplayer Games (MU), pp. 20–34.
ICPC-2008-BohnetVD #comprehension #execution: Locating and Understanding Features of Complex Software Systems by Synchronizing Time-, Collaboration- and Code-Focused Views on Execution Traces (JB, SV, JD), pp. 268–271.
ICPC-2008-HindleGH #complexity #metric: Reading Beside the Lines: Indentation as a Proxy for Complexity Metric (AH, MWG, RCH), pp. 133–142.
ICPC-2008-Kothari #comprehension #fault #scalability: Scalable Program Comprehension for Analyzing Complex Defects (SCK), pp. 3–4.
STOC-2008-AaronsonW #complexity #named: Algebrization: a new barrier in complexity theory (SA, AW), pp. 731–740.
STOC-2008-BartoKN #complexity #graph #morphism #problem: Graphs, polymorphisms and the complexity of homomorphism problems (LB, MK, TN), pp. 789–796.
STOC-2008-BodirskyK #complexity #constraints #problem: The complexity of temporal constraint satisfaction problems (MB, JK), pp. 29–38.
STOC-2008-ChoiK #bound #complexity #graph #query: Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.
STOC-2008-JainKN #bound #communication #complexity #theorem: Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract (RJ, HK, AN), pp. 599–608.
STOC-2008-Rossman #clique #complexity #on the: On the constant-depth complexity of k-clique (BR), pp. 721–730.
FLOPS-2008-AvanziniM #analysis #complexity: Complexity Analysis by Rewriting (MA, GM), pp. 130–146.
DLT-J-2007-HanS08 #complexity #finite: State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 581–595.
AFL-2008-Martyugin #automaton #commutative #complexity #problem #word: Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
CIAA-2008-DolzhenkoJ #2d #complexity #on the #transducer: On Complexity of Two Dimensional Languages Generated by Transducers (ED, NJ), pp. 181–190.
CIAA-2008-HolzerK #complexity #finite #nondeterminism: Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity (MH, MK), pp. 1–16.
DLT-2008-Ada #communication #complexity #nondeterminism #on the #regular expression: On the Non-deterministic Communication Complexity of Regular Languages (AA), pp. 96–107.
DLT-2008-BassinoGN #complexity #finite #linear #set #word: The Average State Complexity of the Star of a Finite Set of Words Is Linear (FB, LG, CN), pp. 134–145.
DLT-2008-CassaigneKZ #complexity #sequence: Relationally Periodic Sequences and Subword Complexity (JC, TK, LQZ), pp. 196–205.
DLT-2008-Jiraskova #complexity #on the #regular expression: On the State Complexity of Complements, Stars, and Reversals of Regular Languages (GJ), pp. 431–442.
DLT-2008-JiraskovaO #automaton #complexity #finite #on the: On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
DLT-2008-KapoutsisKM #automaton #complexity #on the: On the Size Complexity of Rotating and Sweeping Automata (CAK, RK, TM), pp. 455–466.
DLT-2008-SelivanovW #complexity: Complexity of Topological Properties of Regular ω-Languages (VLS, KWW), pp. 529–542.
ICALP-A-2008-AndoniK #complexity #distance #edit distance: The Smoothed Complexity of Edit Distance (AA, RK), pp. 357–369.
ICALP-A-2008-BuchfuhrerU #complexity: The Complexity of Boolean Formula Minimization (DB, CU), pp. 24–35.
ICALP-A-2008-Bulatov #complexity #constraints #problem: The Complexity of the Counting Constraint Satisfaction Problem (AAB), pp. 646–661.
ICALP-A-2008-ChengW #complexity: Complexity of Decoding Positive-Rate Reed-Solomon Codes (QC, DW), pp. 283–293.
ICALP-A-2008-ChenTW #complexity #comprehension #morphism: Understanding the Complexity of Induced Subgraph Isomorphisms (YC, MT, MW), pp. 587–596.
ICALP-A-2008-FialaGK #complexity #distance #problem: Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) (JF, PAG, JK), pp. 294–305.
ICALP-A-2008-Yin #complexity #nondeterminism #proving: Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity (YY), pp. 72–83.
ICALP-B-2008-BodirskyG #complexity #constraints: Non-dichotomies in Constraint Satisfaction Complexity (MB, MG), pp. 184–196.
ICALP-B-2008-BouyerMOW #complexity #model checking #on the #realtime: On Expressiveness and Complexity in Real-Time Model Checking (PB, NM, JO, JW), pp. 124–135.
ICALP-C-2008-KatzKK #complexity #network: Improving the Round Complexity of VSS in Point-to-Point Networks (JK, CYK, RK), pp. 499–510.
GT-VMT-2008-Vangheluwe #modelling #simulation: Foundations of Modelling and Simulation of Complex Systems (HV).
ICGT-2008-RiegerN #data type: Abstracting Complex Data Structures by Hyperedge Replacement (SR, TN), pp. 69–83.
CHI-2008-FindlaterMM #approach #development #evaluation: Evaluation of a role-based approach for customizing a complex development environment (LF, JM, DM), pp. 1267–1270.
CHI-2008-KimGSPPW #experience #realtime #user interface: Tracking real-time user experience (TRUE): a comprehensive instrumentation solution for complex systems (JHK, DVG, ES, BP, RJP, DRW), pp. 443–452.
ICEIS-DISI-2008-BohmWHL #generative #integration #modelling #optimisation #process: Model-Driven Generation and Optimization of Complex Integration Processes (MB, UW, DH, WL), pp. 131–136.
ICEIS-HCI-2008-GeczyIAH #behaviour #enterprise #information management #network: Complex User Behavioral Networks at Enterprise Information Systems (PG, NI, SA, KH), pp. 233–239.
ICEIS-ISAS2-2008-Hawryszkiewycz #modelling: Modeling Increasingly Complex Socio-Technical Environments (ITH), pp. 111–116.
CIKM-2008-BoedihardjoLC #data type #framework #probability: A framework for estimating complex probability density structures in data streams (APB, CTL, FC), pp. 619–628.
CIKM-2008-KaghazianMS #scalability: Scalable complex pattern search in sequential data (LK, DM, RS), pp. 1467–1468.
CIKM-2008-TongSEF #mining #performance: Fast mining of complex time-stamped events (HT, YS, TER, CF), pp. 759–768.
ECIR-2008-MacKinnonV #interactive #wiki: Improving Complex Interactive Question Answering with Wikipedia Anchor Text (IM, OV), pp. 438–445.
ICPR-2008-Baradarani #segmentation #using: Moving object segmentation using the 9/7-10/8 dual-tree complex filter bank (AB), pp. 1–4.
ICPR-2008-HuAS #detection: Detecting global motion patterns in complex videos (MH, SA, MS), pp. 1–5.
ICPR-2008-PengXXD #recognition #using: Face recognition using anisotropic dual-tree complex wavelet packets (YP, XX, WX, QD), pp. 1–4.
ICPR-2008-UkitaKK #using: IBR-based free-viewpoint imaging of a complex scene using few cameras (NU, SK, MK), pp. 1–4.
ICPR-2008-WongCF #adaptation #image #using: Phase-adaptive image signal fusion using complex-valued wavelets (AW, DAC, PWF), pp. 1–4.
ICPR-2008-WuWW #approach #estimation: Motion estimation approach based on dual-tree complex wavelets (CW, QW, HW), pp. 1–4.
ICPR-2008-YuHL #modelling: Double-edge-model based character stroke extraction from complex backgrounds (JY, LH, CL), pp. 1–4.
ICPR-2008-ZhangGZ #detection #modelling: Complex background modeling and motion detection based on Texture Pattern Flow (BZ, YG, BZ), pp. 1–4.
KDD-2008-MeloAL #behaviour #metric #network #predict #question: Can complex network metrics predict the behavior of NBA teams? (POSVdM, VAFA, AAFL), pp. 695–703.
KR-2008-Bienvenu #abduction #complexity #lightweight #logic #product line: Complexity of Abduction in the EL Family of Lightweight Description Logics (MB), pp. 220–230.
KR-2008-EyerichBN #complexity #on the: On the Complexity of Planning Operator Subsumption (PE, MB, BN), pp. 518–527.
KR-2008-KellyP #calculus: Complex Epistemic Modalities in the Situation Calculus (RFK, ARP), pp. 611–620.
KR-2008-RenzL #automation #calculus #complexity #proving: Automated Complexity Proofs for Qualitative Spatial and Temporal Calculi (JR, JJL), pp. 715–723.
SEKE-2008-GaoKF #analysis #complexity #modelling #testing: Model-based Test Complexity Analysis for Software Installation Testing (JG, KK, TF), pp. 631–637.
SIGIR-2008-WuST: User preference choices for complex question answering (MW, FS, AT), pp. 717–718.
MoDELS-2008-MorinVLGBJ #aspect-oriented #complexity #modelling #variability: Managing Variability Complexity in Aspect-Oriented Modeling (BM, GV, PL, AG, OB, JMJ), pp. 797–812.
MoDELS-2008-ParetoSE #embedded #evolution #ontology: Ontology Guided Evolution of Complex Embedded Systems Projects in the Direction of MDA (LP, MS, PE), pp. 874–888.
MoDELS-2008-MorinVLGBJ #aspect-oriented #complexity #modelling #variability: Managing Variability Complexity in Aspect-Oriented Modeling (BM, GV, PL, AG, OB, JMJ), pp. 797–812.
MoDELS-2008-ParetoSE #embedded #evolution #ontology: Ontology Guided Evolution of Complex Embedded Systems Projects in the Direction of MDA (LP, MS, PE), pp. 874–888.
PPDP-2008-MarionP #complexity #polynomial: Characterizations of polynomial complexity classes with a better intensionality (JYM, RP), pp. 79–88.
POPL-2008-Danielsson #analysis #complexity #data type #functional #lightweight: Lightweight semiformal time complexity analysis for purely functional data structures (NAD), pp. 133–144.
REFSQ-2008-RegnellBW #complexity #question #requirements #scalability: Can We Beat the Complexity of Very Large-Scale Requirements Engineering? (BR, RBS, KW), pp. 123–128.
SAC-2008-AndresAN #experience #formal method #information management #using: Using formal methods to develop a complex information system: a practical/theoretical experience (CA, RGA, MN), pp. 848–849.
SAC-2008-DaltioMGL #framework #process #query: A framework to process complex biodiversity queries (JD, CBM, LGJ, TML), pp. 2293–2297.
SAC-2008-GennaroMOR #network #peer-to-peer #query #similarity: Processing complex similarity queries in peer-to-peer networks (CG, MM, SO, FR), pp. 473–478.
SAC-2008-MatosCPO #adaptation #distributed #middleware #named: Serpentine: adaptive middleware for complex heterogeneous distributed systems (MM, ACJ, JP, RCO), pp. 2219–2223.
SAC-2008-RamnathR #adaptation #enterprise #execution #modelling: Integrating goal modeling and execution in adaptive complex enterprises (RR, JR), pp. 532–539.
ICSE-2008-ElkarabliehK #data type #named: Juzi: a tool for repairing complex data structures (BE, SK), pp. 855–858.
ICSE-2008-MalikPUK #generative #invariant #named #representation: Deryaft: a tool for generating representation invariants of structurally complex data (MZM, AP, EU, SK), pp. 859–862.
OSDI-2008-CadarDE #automation #generative #named #source code #testing: KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs (CC, DD, DRE), pp. 209–224.
CSL-2008-DawarG #complexity #game studies: The Descriptive Complexity of Parity Games (AD, EG), pp. 354–368.
ICST-2008-BeerM #dependence #generative #performance #testing: Efficient Test Data Generation for Variables with Complex Dependencies (AB, SM), pp. 3–11.
IJCAR-2008-AvanziniMS #analysis #automation #complexity: Automated Implicit Computational Complexity Analysis (System Description) (MA, GM, AS), pp. 132–138.
IJCAR-2008-HirokawaM #analysis #automation #complexity #dependence: Automated Complexity Analysis Based on the Dependency Pair Method (NH, GM), pp. 364–379.
IJCAR-2008-Lutz #complexity #logic #query: The Complexity of Conjunctive Query Answering in Expressive Description Logics (CL), pp. 179–193.
LICS-2008-AehligB #complexity #on the: On the Computational Complexity of Cut-Reduction (KA, AB), pp. 284–293.
LICS-2008-ChadhaSV #complexity #finite #monitoring #on the: On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.
LICS-2008-ChambartS #complexity #recursion: The Ordinal Recursive Complexity of Lossy Channel Systems (PC, PS), pp. 205–216.
LICS-2008-Riis #calculus #complexity #on the #polynomial #proving: On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity (SR), pp. 272–283.
RTA-2008-MoserS #polynomial #proving #using: Proving Quadratic Derivational Complexities Using Context Dependent Interpretations (GM, AS), pp. 276–290.
SAT-2008-Gao #algorithm #complexity #problem #random: Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.
SAT-2008-GeorgiouP #algorithm #complexity #satisfiability: Complexity and Algorithms for Well-Structured k-SAT Instances (KG, PAP), pp. 105–118.
ASE-2007-ElkarabliehGSK #data type: Assertion-based repair of complex data structures (BE, IG, YLS, SK), pp. 64–73.
DATE-2007-BrackALKWLRRF #complexity #generative #standard: Low complexity LDPC code decoders for next generation standards (TB, MA, TLE, FK, NW, NEL, FR, MR, LF), pp. 331–336.
DATE-2007-SchlieckerSE #analysis #composition #data flow #graph #integration #performance: Performance analysis of complex systems by integration of dataflow graphs and compositional performance analysis (SS, SS, RE), pp. 273–278.
DATE-2007-WuLLH #named #robust #satisfiability: QuteSAT: a robust circuit-based SAT solver for complex circuit structure (CAW, THL, CCL, CYH), pp. 1313–1318.
DRR-2007-ArgamonFGL #documentation #image #retrieval: Content-based document image retrieval in complex document collections (SA, OF, DAG, DDL).
ICDAR-2007-FathallaEI #image #word: Extraction of Arabic Words from Complex Color Image (RF, YES, MAI), pp. 1223–1227.
ICDAR-2007-KumarKJ #documentation #on the #segmentation: On Segmentation of Documents in Complex Scripts (KSSK, SK, CVJ), pp. 1243–1247.
ICDAR-2007-PanBS #segmentation #using: Text Segmentation from Complex Background Using Sparse Representations (WP, TDB, CYS), pp. 412–416.
PODS-2007-CateL #complexity #query #xpath: The complexity of query containment in expressive fragments of XPath 2.0 (BtC, CL), pp. 73–82.
PODS-2007-FanGN #complexity #transducer #xml: Expressiveness and complexity of xml publishing transducers (WF, FG, FN), pp. 83–92.
PODS-2007-KasneciS #complexity #reasoning #xml: The complexity of reasoning about pattern-based XML schemas (GK, TS), pp. 155–164.
PODS-2007-SenellartA #complexity #on the #probability #xml: On the complexity of managing probabilistic XML data (PS, SA), pp. 283–292.
VLDB-2007-YuJ #database #query: Querying Complex Structured Databases (CY, HVJ), pp. 1010–1021.
CSEET-2007-NaumanU #collaboration #scalability #student: SE and CS Collaboration: Training Students for Engineering Large, Complex Systems (MN, MU), pp. 167–174.
ITiCSE-2007-BureaC #complexity: Complexity of ambient intelligence in managerial work (VB, PC), p. 325.
FoSSaCS-2007-BaulandSSSV #complexity #linear #logic #satisfiability: The Complexity of Generalized Satisfiability for Linear Temporal Logic (MB, TS, HS, IS, HV), pp. 48–62.
FoSSaCS-2007-LaroussinieMO #atl #complexity #on the: On the Expressiveness and Complexity of ATL (FL, NM, GO), pp. 243–257.
FoSSaCS-2007-TozawaM #complexity #context-free grammar: Complexity Results on Balanced Context-Free Languages (AT, YM), pp. 346–360.
TACAS-2007-MalikPK #generative #invariant #representation: Generating Representation Invariants of Structurally Complex Data (MZM, AP, SK), pp. 34–49.
TACAS-2007-RasmussenBL #complexity #flexibility: Complexity in Simplicity: Flexible Agent-Based State Space Exploration (JIR, GB, KGL), pp. 231–245.
ICPC-2007-Vivanco #algorithm #complexity #identification #metric #modelling #predict #search-based #source code: Use of a Genetic Algorithm to Identify Source Code Metrics Which Improves Cognitive Complexity Predictive Models (RAV), pp. 297–300.
STOC-2007-Basu #combinator #complexity #geometry: Combinatorial complexity in O-minimal geometry (SB), pp. 47–56.
STOC-2007-Dantchev #complexity #proving #rank: Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (SSD), pp. 311–317.
STOC-2007-GavinskyKKRW #communication #complexity #encryption #exponential #quantum: Exponential separations for one-way quantum communication complexity, with applications to cryptography (DG, JK, IK, RR, RdW), pp. 516–525.
STOC-2007-HartM #communication #complexity #equilibrium #nash: The communication complexity of uncoupled nash equilibrium procedures (SH, YM), pp. 345–353.
STOC-2007-LinialS #bound #communication #complexity: Lower bounds in communication complexity based on factorization norms (NL, AS), pp. 699–708.
CIAA-J-2006-SalomaaY07 #complexity #estimation #on the: On the State Complexity of Combined Operations and their Estimation (KS, SY), pp. 683–698.
DLT-2007-GruberH #complexity #exclamation #nondeterminism: Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP (HG, MH), pp. 205–216.
DLT-2007-HanS #complexity #finite: State Complexity of Union and Intersection of Finite Languages (YSH, KS), pp. 217–228.
DLT-2007-LoosO #complexity: Complexity Theory for Splicing Systems (RL, MO), pp. 300–311.
DLT-2007-MalcherP #bound #complexity #context-free grammar: Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.
DLT-2007-Salomaa #automaton #complexity #finite #nondeterminism: Descriptional Complexity of Nondeterministic Finite Automata (KS), pp. 31–35.
ICALP-2007-BeameDPW #communication #complexity #multi #nondeterminism: Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity (PB, MD, TP, PW), pp. 134–145.
ICALP-2007-BienvenuM #complexity: Reconciling Data Compression and Kolmogorov Complexity (LB, WM), pp. 643–654.
ICALP-2007-BlaserD #complexity #polynomial: Complexity of the Cover Polynomial (MB, HD), pp. 801–812.
ICALP-2007-BurgisserC #complexity #problem #quantifier: Exotic Quantifiers, Complexity Classes, and Complete Problems (PB, FC), pp. 207–218.
ICALP-2007-DershowitzT #complexity #proving: Complexity of Propositional Proofs Under a Promise (ND, IT), pp. 291–302.
ICALP-2007-IwamaNRY #bound #communication #complexity #quantum: Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.
ICALP-2007-LuTW #complexity #on the #set: On the Complexity of Hard-Core Set Constructions (CJL, SCT, HLW), pp. 183–194.
ICALP-2007-MontanaroW #bound #communication #complexity #quantum: A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (AM, AJW), pp. 122–133.
ICALP-2007-TorreP #complexity #model checking #on the #recursion #state machine: On the Complexity of LtlModel-Checking of Recursive State Machines (SLT, GP), pp. 937–948.
LATA-2007-AblayevG #branch #complexity #quantum #simulation #source code: Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.
LATA-2007-DassowF #approach #comparison: Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach (JD, HF), pp. 249–260.
LATA-2007-GruberH #automaton #complexity #finite #nondeterminism: Computational Complexity of NFA Minimization for Finite and Unary Languages (HG, MH), pp. 261–272.
LATA-2007-LenaM #automaton #complexity: Computational Complexity of Dynamical Systems: the case of Cellular Automata (PdL, LM), pp. 211–222.
LATA-2007-LiuMSY #complexity: State Complexity of Basic Operations Combined with Reversal (GL, CMV, AS, SY), pp. 355–366.
LATA-2007-MasopustM #complexity: Descriptional Complexity of Grammars Regulated by Context Conditions (TM, AM), pp. 403–412.
LATA-2007-Povarov #complexity #regular expression: Descriptive Complexity of the Hamming Neighborhood of a Regular Language (GP), pp. 509–520.
IFM-2007-FaberJS #data type #parametricity #specification #verification: Verifying CSP-OZ-DC Specifications with Complex Data Types and Timing Parameters (JF, SJ, VSS), pp. 233–252.
ICFP-2007-HornM #analysis #complexity #control flow #precise: Relating complexity and precision in control flow analysis (DVH, HGM), pp. 85–96.
IFL-2007-DijkstraFS #compilation #complexity #haskell: The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity (AD, JF, SDS), pp. 57–74.
AGTIVE-2007-TaentzerCSE #editing #generative: Generating Domain-Specific Model Editors with Complex Editing Commands (GT, AC, RS, CE), pp. 98–103.
DHM-2007-AndreoniRP #simulation: Simulation of Complex Human Movement Through the Modulation of Observed Motor Tasks (GA, MR, AP), pp. 3–12.
DHM-2007-DeLaurentis #complexity: Role of Humans in Complexity of a System-of-Systems (DD), pp. 363–371.
DHM-2007-RapalaN #reliability #safety: Clinical Patient Safety — Achieving High Reliability in a Complex System (KR, JCN), pp. 710–716.
DHM-2007-WangYLLT #human-computer #interface: Brain-Computer Interfaces Based on Attention and Complex Mental Tasks (JW, NY, HL, ML, CT), pp. 467–473.
DHM-2007-XuWZZ #algorithm #complexity #predict: An Epileptic Seizure Prediction Algorithm from Scalp EEG Based on Morphological Filter and Kolmogorov Complexity (GX, JW, QZ, JZ), pp. 736–746.
HCI-AS-2007-Song #analysis #complexity #segmentation #visual notation #web: Analysis of Web Page Complexity Through Visual Segmentation (GS), pp. 114–123.
HCI-AS-2007-UflackerB #complexity #enterprise #experience #user interface: Complexity in Enterprise Applications vs. Simplicity in User Experience (MU, DKB), pp. 778–787.
HCI-AS-2007-Xing #complexity: Information Complexity in Air Traffic Control Displays (JX), pp. 797–806.
HCI-IDU-2007-LingLX #complexity #using #validation #web: Validating Information Complexity Questionnaires Using Travel Web Sites (CL, ML, JX), pp. 901–910.
HCI-MIE-2007-DongLH #complexity #segmentation #user interface: Effect of Glance Duration on Perceived Complexity and Segmentation of User Interfaces (YD, CL, LH), pp. 605–614.
HCI-MIE-2007-Sarter #adaptation #complexity #design #interface: Coping with Complexity Through Adaptive Interface Design (NBS), pp. 493–498.
HIMI-IIE-2007-FuCS #complexity #web: Measuring the Screen Complexity of Web Pages (FLF, SYC, CHS), pp. 720–729.
EDOC-2007-DeckerGB #modelling #process #visual notation: A Graphical Notation for Modeling Complex Events in Business Processes (GD, AG, APB), pp. 27–36.
CIKM-2007-EavisT #named #performance: Mapgraph: efficient methods for complex olap hierarchies (TE, AT), pp. 465–474.
ICML-2007-Hanneke #bound #complexity #learning: A bound on the label complexity of agnostic active learning (SH), pp. 353–360.
ICML-2007-WoznicaKH #learning: Learning to combine distances for complex representations (AW, AK, MH), pp. 1031–1038.
KDD-2007-DeodharG #clustering #framework #learning: A framework for simultaneous co-clustering and learning from complex data (MD, JG), pp. 250–259.
KDD-2007-ZhaoDZ #mining #network: Mining complex power networks for blackout prevention (JHZ, ZYD, PZ), pp. 986–994.
RecSys-2007-AngladeTV #clustering #identification: Complex-network theoretic clustering for identifying groups of similar listeners in p2p systems (AA, MT, FV), pp. 41–48.
SEKE-2007-RavatTTZ: Integrating Complex Data into a Data Warehouse (FR, OT, RT, GZ), p. 483–?.
SIGIR-2007-LinZ #evaluation #reliability: Deconstructing nuggets: the stability and reliability of complex question answering evaluation (JJL, PZ), pp. 327–334.
ECOOP-2007-ElkarabliehZK #generative: Efficiently Generating Structurally Complex Inputs with Thousands of Objects (BE, YZ, SK), pp. 248–272.
OOPSLA-2007-ElkarabliehKVM #named #performance #static analysis: Starc: static analysis for efficient repair of complex data (BE, SK, DV, KSM), pp. 387–404.
REFSQ-2007-NcubeLM #automation #case study #experience #generative #modelling #requirements: Automatically Generating Requirements from i* Models: Experiences with a Complex Airport Operations System (CN, JL, NAMM), pp. 33–47.
SAC-2007-Al-NaymatCG #query #reduction: Dimensionality reduction for long duration and complex spatio-temporal queries (GAN, SC, JG), pp. 393–397.
ESEC-FSE-2007-GoldsmithAW #complexity #empirical: Measuring empirical computational complexity (SG, AA, DSW), pp. 395–404.
ICSE-2007-MilicevicMMK #generative #named #testing: Korat: A Tool for Generating Structurally Complex Test Inputs (AM, SM, DM, SK), pp. 771–774.
SPLC-2007-MebaneO #complexity #product line: Dynamic Complexity and the Owen Firmware Product Line Program (HM, JTO), pp. 212–222.
CGO-2007-BouchezDR #complexity #on the: On the Complexity of Register Coalescing (FB, AD, FR), pp. 102–114.
LCTES-2007-BouchezDR #complexity #on the: On the complexity of spill everywhere under SSA form (FB, AD, FR), pp. 103–112.
CSL-2007-AehligCN #complexity: Relativizing Small Complexity Classes and Their Theories (KA, SAC, PN), pp. 374–388.
CSL-2007-Beckmann #complexity #proving #source code: Proofs, Programs and Abstract Complexity (AB), pp. 4–5.
CSL-2007-Goller #complexity #on the #policy #reasoning: On the Complexity of Reasoning About Dynamic Policies (SG), pp. 358–373.
ICLP-2007-Nguyen #approximate #complexity #knowledge base #logic: Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity (LAN), pp. 438–439.
LICS-2007-BaillotCL #complexity #logic #reduction: Light Logics and Optimal Reduction: Completeness and Complexity (PB, PC, UDL), pp. 421–430.
LICS-2007-NguyenC #complexity #proving #theorem: The Complexity of Proving the Discrete Jordan Curve Theorem (PN, SAC), pp. 245–256.
ASE-2006-MancinelliBCVDLT #complexity #open source #scalability: Managing the Complexity of Large Free and Open Source Package-Based Software Distributions (FM, JB, RDC, JV, BD, XL, RT), pp. 199–208.
CASE-2006-PengWL #image: A Strategy Improving Registration Accuracy Progressively for INSAR Complex Image (SP, YW, GL), pp. 626–629.
CASE-2006-WuD #analysis #multi #network #performance: Performance analysis of complex supply chain networks with multi-product (YW, MD), pp. 630–635.
CASE-2006-XingTXH #complexity #concurrent #flexibility #policy #polynomial: Optimal Polynomial Complexity Deadlock Avoidance Policies for Manufacturing Systems with Flexible Routings (KX, FT, HX, BH), pp. 448–453.
DAC-2006-WilsonZ: Decision-making for complex SoCs in consumer electronic products (RW, YZ), p. 173.
DATE-2006-NascimentoL #architecture #clustering #complexity #configuration management #image: Temporal partitioning for image processing based on time-space complexity in reconfigurable architectures (PSBdN, MEdL), pp. 375–380.
DATE-2006-ProchnowH #modelling: Comfortable modeling of complex reactive systems (SP, RvH), pp. 577–578.
DATE-2006-SrinivasanC #architecture #complexity #design #heuristic: A low complexity heuristic for design of custom network-on-chip architectures (KS, KSC), pp. 130–135.
DATE-2006-Weber #communication #network: Management of complex automotive communication networks (TW), pp. 554–555.
DRR-2006-AgamAFGL #documentation #evaluation #information management #prototype: Complex document information processing: prototype, test collection, and evaluation (GA, SA, OF, DAG, DL).
PODS-2006-KolaitisPT #complexity: The complexity of data exchange (PGK, JP, WCT), pp. 30–39.
SIGMOD-2006-Amer-YahiaCD #flexibility #performance #xml: Flexible and efficient XML search with complex full-text predicates (SAY, EC, AD), pp. 575–586.
SIGMOD-2006-WuDR: High-performance complex event processing over streams (EW, YD, SR), pp. 407–418.
VLDB-2006-BarioniRTT #named #retrieval #similarity: SIREN: A Similarity Retrieval Engine for Complex Data (MCNB, HLR, AJMT, CTJ), pp. 1155–1158.
VLDB-2006-HabichRL #database #named #optimisation: GignoMDA — Exploiting Cross-Layer Optimization for Complex Database Applications (DH, SR, WL), p. 1251–?.
SAS-2006-BouajjaniHRV #data type #model checking: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (AB, PH, AR, TV), pp. 52–70.
STOC-2006-DaskalakisGP #complexity #equilibrium #nash: The complexity of computing a Nash equilibrium (CD, PWG, CHP), pp. 71–78.
STOC-2006-DubrovI #complexity #on the #performance: On the randomness complexity of efficient sampling (BD, YI), pp. 711–720.
STOC-2006-GavinskyKRW #bound #communication #complexity #exponential #identification #quantum: Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.
CIAA-2006-MesserschmidtMOP #complexity #correctness: Correctness Preservation and Complexity of Simple RL-Automata (HM, FM, FO, MP), pp. 162–172.
CIAA-2006-Yu #complexity #on the: On the State Complexity of Combined Operations (SY), pp. 11–22.
DLT-2006-Borel #3d #complexity #word: Complexity of Degenerated Three Dimensional Billiard Words (JPB), pp. 386–396.
DLT-2006-GruberH #bound #complexity #nondeterminism: Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.
DLT-2006-MrazOP #on the: On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.
DLT-2006-Shur #combinator #complexity: Factorial Languages of Low Combinatorial Complexity (AMS), pp. 397–407.
ICALP-v1-2006-ChenD #2d #complexity #fixpoint #on the #problem: On the Complexity of 2D Discrete Fixed Point Problem (XC, XD), pp. 489–500.
ICALP-v1-2006-DaskalakisFP #complexity #game studies #nash: The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (CD, AF, CHP), pp. 513–524.
ICALP-v1-2006-FortnowHPVW #complexity: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (LF, JMH, AP, NVV, FW), pp. 335–345.
ICALP-v1-2006-UchizawaDM #complexity #energy: Energy Complexity and Entropy of Threshold Circuits (KU, RJD, WM), pp. 631–642.
ICALP-v2-2006-BonattiLMV #calculus #complexity #μ-calculus: The Complexity of Enriched μ-Calculi (PAB, CL, AM, MYV), pp. 540–551.
ICALP-v2-2006-Jurdzinski #complexity #on the #problem #safety: On Complexity of Grammars Related to the Safety Problem (TJ), pp. 432–443.
ICALP-v2-2006-KawachiY #quantum: Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (AK, TY), pp. 216–227.
SOFTVIS-2006-BohnetD #feature model #graph #visual notation: Visual exploration of function call graphs for feature location in complex software systems (JB, JD), pp. 95–104.
EDOC-2006-ZuoLW #fault tolerance #transaction: A Fault-Tolerant Scheme for Complex Transaction Patterns in J2EE (LZ, SL, JW), pp. 165–174.
ICEIS-SAIC-2006-MarjanovicSMRG #approach #collaboration #learning #process: Supporting Complex Collaborative Learning Activities — The Libresource Approach (OM, HSM, PM, FAR, CG), pp. 59–65.
CIKM-2006-TrainaTVAF #performance #query #similarity: Efficient processing of complex similarity queries in RDBMS through query rewriting (CTJ, AJMT, MRV, ASA, CF), pp. 4–13.
ECIR-2006-VinayCMW #complexity #documentation: Measuring the Complexity of a Collection of Documents (VV, IJC, NMF, KRW), pp. 107–118.
ICML-2006-ReyzinS #classification #complexity #how: How boosting the margin can also boost classifier complexity (LR, RES), pp. 753–760.
ICML-2006-RossOZ: Combining discriminative features to infer complex trajectories (DAR, SO, RSZ), pp. 761–768.
ICPR-v1-2006-CastelanH06a #statistics: A Facial Statistical Model from Complex Numbers (MC, ERH), pp. 235–238.
ICPR-v1-2006-ChenCW #complexity #image: LBT Based Low Complexity Image Compression Method (BC, LC, HW), pp. 941–944.
ICPR-v1-2006-LiuJK #retrieval: Fingerprint Retrieval by Complex Filter Responses (ML, XJ, ACK), p. 1042.
ICPR-v2-2006-LeL #hybrid: A Hybrid License Plate Extraction Method for Complex Scenes (WL, SL), pp. 324–327.
ICPR-v2-2006-LiuSXR #complexity #feature model #image: Image Complexity and Feature Extraction for Steganalysis of LSB Matching Steganography (QL, AHS, JX, BR), pp. 267–270.
ICPR-v2-2006-SuBC #2d #adaptation #complexity: Scale Adaptive Complexity Measure of 2D Shapes (HS, AB, DC), pp. 134–137.
ICPR-v2-2006-TianK #invariant: A Low-Complexity Deformation Invariant Descriptor (LT, SiK), pp. 227–230.
ICPR-v3-2006-HuS #complexity: Regularity and Complexity of Human Electroencephalogram Dynamics: Applications to Diagnosis of Alzheimers Disease (ZH, PS), pp. 245–248.
ICPR-v4-2006-JiaQ #complexity: Improved Stone’s Complexity Pursuit for Hyperspectral Imagery Unmixing (SJ, YQ), pp. 817–820.
ICPR-v4-2006-MoncrieffVW #modelling #using: Unifying Background Models over Complex Audio using Entropy (SM, SV, GAWW), pp. 249–253.
KDD-2006-MierswaWKSE #agile #data mining #mining #named #prototype: YALE: rapid prototyping for complex data mining tasks (IM, MW, RK, MS, TE), pp. 935–940.
KDD-2006-VirdhagriswaranD #detection: Camouflaged fraud detection in domains with complex relationships (SV, GD), pp. 941–947.
KR-2006-CalvaneseGLLR #complexity #logic #query: Data Complexity of Query Answering in Description Logics (DC, GDG, DL, ML, RR), pp. 260–270.
SEKE-2006-YuLSH #modelling #using: Modeling Complex Software Systems Using an Aspect Extension of Object-Z (HY, DL, ZS, XH), pp. 11–16.
SIGIR-2006-ArgamonAFGLSV #documentation #information management #prototype: A complex document information processing prototype (SA, GA, OF, DAG, DDL, GS, EMV), pp. 599–600.
SIGIR-2006-HarabagiuLH #modelling #random: Answering complex questions with random walk models (SMH, VFL, AH), pp. 220–227.
SIGIR-2006-LewisAAFGH #documentation #information management: Building a test collection for complex document information processing (DDL, GA, SA, OF, DAG, JH), pp. 665–666.
PADL-2006-LiuS #graph #query: Querying Complex Graphs (YAL, SDS), pp. 199–214.
RE-2006-DanevaW #complexity #coordination #enterprise #requirements: A Coordination Complexity Model to Support Requirements Engineering for Cross-organizational ERP (MD, RW), pp. 304–307.
RE-2006-ReiserW #multi #product line: Managing Highly Complex Product Families with Multi-Level Feature Trees (MOR, MW), pp. 146–155.
SAC-2006-BodhuinCPT #complexity #physics: Hiding complexity and heterogeneity of the physical world in smart living environments (TB, GC, RP, MT), pp. 1921–1927.
SAC-2006-HeDZ #estimation #grid #modelling #parametricity #scalability: Service-oriented grid computation for large-scale parameter estimation in complex environmental modeling (KH, SD, LZ), pp. 741–745.
SAC-2006-NguyenLL #case study #modelling #process: A space aware agent-based modeling process for the study of hierarchical complex systems (TMLN, CL, IL), pp. 126–127.
SAC-2006-PaluPHL #3d #approach #constraints #logic programming #scalability: A constraint logic programming approach to 3D structure determination of large protein complexes (ADP, EP, JH, YL), pp. 131–136.
CAV-2006-BustanH #complexity: Some Complexity Results for SystemVerilog Assertions (DB, JH), pp. 205–218.
CSL-2006-ArtemovK #complexity #logic #proving: Logical Omniscience Via Proof Complexity (SNA, RK), pp. 135–149.
LICS-2006-Lago #complexity #linear #logic #semantics: Context Semantics, Linear Logic and Computational Complexity (UDL), pp. 169–178.
LICS-2006-LaurentF #bound #clique #complexity #semantics: Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity (OL, LTdF), pp. 179–188.
SAT-2006-BubeckB #complexity #dependence #modelling #quantifier: Dependency Quantified Horn Formulas: Models and Complexity (UB, HKB), pp. 198–211.
SAT-2006-KojevnikovK #algebra #complexity #proving #strict: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.
SAT-2006-ZabiyakaD #bound #complexity #dependence #functional: Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies (YZ, AD), pp. 116–129.
VMCAI-2006-Bozzelli #automaton #complexity #model checking: Complexity Results on Branching-Time Pushdown Model Checking (LB), pp. 65–79.
VMCAI-2006-HristovaL #algorithm #automaton #linear #logic #model checking: Improved Algorithm Complexities for Linear Temporal Logic Model Checking of Pushdown Systems (KH, YAL), pp. 190–206.
DAC-2005-HeitheckerE #requirements: Traffic shaping for an FPGA based SDRAM controller with complex QoS requirements (SH, RE), pp. 575–578.
DATE-2005-ChenLL #integration #layout #multi #verification: Integration, Verification and Layout of a Complex Multimedia SOC (CLC, JYL, YLL), pp. 1116–1117.
DATE-2005-HaiYC #modelling #realtime: Unified Modeling of Complex Real-Time Control Systems (HH, ZYf, CCl), pp. 498–499.
DATE-2005-KavvadiasN #embedded #hardware: Hardware Support for Arbitrarily Complex Loop Structures in Embedded Applications (NK, SN), pp. 1060–1061.
DATE-2005-TangWD #complexity #power management #synthesis: MINLP Based Topology Synthesis for Delta Sigma Modulators Optimized for Signal Path Complexity, Sensitivity and Power Consumption (HT, YW, AD), pp. 264–269.
DATE-2005-VanderperrenD #approach #complexity #design #uml: UML 2 and SysML: An Approach to Deal with Complexity in SoC/NoC Design (YV, WD), pp. 716–717.
DocEng-2005-YacoubBFOPS #documentation #lifecycle: Document digitization lifecycle for complex magazine collection (SMY, JB, PF, DO, JLAP, VS), pp. 197–206.
ICDAR-2005-LinT #design: Text Extraction from Name Cards with Complex Design (LL, CLT), pp. 977–980.
ICDAR-2005-YacoubSS #documentation #named: PerfectDoc: A Ground Truthing Environment for Complex Documents (SMY, VS, SNS), pp. 452–457.
PODS-2005-HershbergerSST #complexity #data type #multi: Space complexity of hierarchical heavy hitters in multi-dimensional data streams (JH, NS, SS, CDT), pp. 338–347.
PODS-2005-Koch #complexity #functional #on the #query #recursion #xquery: On the complexity of nonrecursive XQuery and functional query languages on complex values (CK), pp. 84–97.
PODS-2005-LeindersB #algebra #complexity #on the #relational #set: On the complexity of division and set joins in the relational algebra (DL, JVdB), pp. 76–83.
SIGMOD-2005-DongHMN: Reference Reconciliation in Complex Information Spaces (XD, AYH, JM), pp. 85–96.
SIGMOD-2005-IacobD #framework #xml: A framework for processing complex document-centric XML with overlapping structures (IEI, AD), pp. 897–899.
SIGMOD-2005-MorishimaOTI #named #semantics #xml: SMART: a tool for semantic-driven creation of complex XML mappings (AM, TO, JT, KI), pp. 909–911.
VLDB-2005-HadjieleftheriouKBT #query: Complex Spatio-Temporal Pattern Queries (MH, GK, PB, VJT), pp. 877–888.
VLDB-2005-HeMYW #interface #named #web: WISE-Integrator: A System for Extracting and Integrating Complex Web Search Interfaces of the Deep Web (HH, WM, CTY, ZW), pp. 1314–1317.
VLDB-2005-LiuZJMR #adaptation #distributed #query: A Dynamically Adaptive Distributed System for Processing Complex Continuous Queries (BL, YZ, MJ, BM, EAR), pp. 1338–1341.
ITiCSE-2005-Christensen05a #architecture #complexity #java #named: TS-05: 150 lines of java with high architectural complexity (HBC), p. 396.
ITiCSE-2005-Hovis #complexity #programming: Managing the complexity in first year programming (RAH), p. 394.
ITiCSE-2005-NodelmanH #analysis: Complex analysis in computer graphics course (VN, BH), p. 381.
ESOP-2005-NiehrenPS #complexity #satisfiability #type system: Complexity of Subtype Satisfiability over Posets (JN, TP, ZS), pp. 357–373.
FoSSaCS-2005-BontempsS #complexity #sequence chart: The Complexity of Live Sequence Charts (YB, PYS), pp. 364–378.
CSMR-2005-CapiluppiFR #complexity #cumulative #open source: Exploring the Relationship between Cumulative Change and Complexity in an Open Source System (AC, AEF, JFR), pp. 21–29.
ICSM-2005-Lock #analysis #modelling #named: Strider: Configuration Modelling and Analysis of Complex Systems (SL), pp. 495–504.
STOC-2005-Aaronson #complexity: The complexity of agreement (SA), pp. 634–643.
STOC-2005-Ben-SassonS #complexity #query: Simple PCPs with poly-log rate and query complexity (EBS, MS), pp. 266–275.
STOC-2005-GafniGP #adaptation #bound #complexity #set: From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.
STOC-2005-SanghviV #complexity #random: The round complexity of two-party random selection (SS, SPV), pp. 338–347.
STOC-2005-Shi #communication #complexity #metric #quantum: Tensor norms and the classical communication complexity of nonlocal quantum measurement (YS), pp. 460–467.
CIAA-J-2004-JirasekJS05 #complexity: State complexity of concatenation and complementation (JJ, GJ, AS), pp. 511–529.
CIAA-J-2004-KrawetzLS05 #complexity #finite #monad #set: State complexity and the monoid of transformations of a finite set (BK, JL, JS), pp. 547–563.
DLT-J-2004-Lohrey05 #automation #complexity #decidability #monad: Decidability and complexity in automatic monoids (ML), pp. 707–722.
DLT-2005-AblayevG #automaton #complexity #quantum: Complexity of Quantum Uniform and Nonuniform Automata (FMA, AG), pp. 78–87.
ICALP-2005-AbdullaDOW #automaton #complexity #decidability: Decidability and Complexity Results for Timed Automata via Channel Machines (PAA, JD, JO, JW), pp. 1089–1101.
ICALP-2005-BeamePS #bound #communication #complexity #multi: Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (PB, TP, NS), pp. 1176–1188.
ICALP-2005-ChatterjeeAH #complexity #game studies #probability: The Complexity of Stochastic Rabin and Streett Games (KC, LdA, TAH), pp. 878–890.
ICALP-2005-FordG #bound #communication #complexity #multi: Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity (JF, AG), pp. 1163–1175.
ICALP-2005-KoiranNP #bound #complexity #problem #quantum #query: A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.
ICALP-2005-MagniezN #commutative #complexity #quantum #testing: Quantum Complexity of Testing Group Commutativity (FM, AN), pp. 1312–1324.
ICALP-2005-PatrascuP #complexity #on the: On Dynamic Bit-Probe Complexity (CEP, MP), pp. 969–981.
ICALP-2005-TessonT #communication #complexity #strict: Restricted Two-Variable Sentences, Circuits and Communication Complexity (PT, DT), pp. 526–538.
SEFM-2005-DittmarF: A unified description formalism for complex HCI-systems (AD, PF), pp. 342–351.
SEFM-2005-Trakhtenbrot #debugging #testing #verification: Use of Verification for Testing and Debugging of Complex Reactive Systems (MBT), pp. 13–22.
ICEIS-v5-2005-KriegelKPR #performance: Efficient Join Processing for Complex Rasterized Objects (HPK, PK, MP, MR), pp. 20–30.
CIKM-2005-GrecoS #complexity #consistency #integration #on the #peer-to-peer #query: On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems (GG, FS), pp. 36–43.
CIKM-2005-MasonL #complexity #named #query #relational #sql: INFER: a relational query language without the complexity of SQL (TM, RL), pp. 241–242.
KDD-2005-Barabasi #architecture #complexity #network #web: The architecture of complexity: the structure and the dynamics of networks, from the web to the cell (ALB), p. 3.
KDD-2005-JinSA #information management #mining #optimisation: Simultaneous optimization of complex mining tasks with a knowledgeable cache (RJ, KS, GA), pp. 600–605.
MLDM-2005-PrayR #mining: Mining Expressive Temporal Associations from Complex Data (KAP, CR), pp. 384–394.
SIGIR-2005-StrohmanTC #optimisation #query: Optimization strategies for complex queries (TS, HRT, WBC), pp. 219–225.
MoDELS-2005-CuccuruDMB #modelling #towards #uml: Towards UML 2 Extensions for Compact Modeling of Regular Complex Topologies (AC, JLD, PM, PB), pp. 445–459.
MoDELS-2005-CuccuruDMB #modelling #towards #uml: Towards UML 2 Extensions for Compact Modeling of Regular Complex Topologies (AC, JLD, PM, PB), pp. 445–459.
OOPSLA-2005-SangalJSJ #architecture #dependence #modelling #using: Using dependency models to manage complex software architecture (NS, EJ, VS, DJ), pp. 167–176.
RE-2005-BittnerBPRW #requirements #reuse #scalability #variability: Managing Variability and Reuse of Features and Requirements for Large and Complex Organizational Structures (MB, AB, AP, MOR, MW), pp. 469–470.
SAC-2005-ChenCG #biology #database #query: A complex biological database querying method (JYC, JVC, NG), pp. 110–114.
SAC-2005-HuP #3d #complexity #parametricity: Volume fractal dimensionality: a useful parameter for measuring the complexity of 3D protein spatial structures (MH, QP), pp. 172–176.
SAC-2005-TayJ #adaptation #framework #named #simulation: CAFISS: a complex adaptive framework for immune system simulation (JCT, AJ), pp. 158–164.
SAC-2005-ZhouX #approach #complexity #diagrams: Measuring structural complexity for class diagrams: an information theory approach (YZ, BX), pp. 1679–1683.
ICSE-2005-LeonMP #data flow #empirical #evaluation #testing: An empirical evaluation of test case filtering techniques based on exercising complex information flows (DL, WM, AP), pp. 412–421.
SPLC-2005-ReiserW #set #using: Using Product Sets to Define Complex Product Decisions (MOR, MW), pp. 21–32.
SAT-J-2004-BaulandCCHV05 #algebra #approach #complexity #query: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.
CADE-2005-VermaSS #complexity #equation #horn clause #on the: On the Complexity of Equational Horn Clauses (KNV, HS, TS), pp. 337–352.
CSL-2005-BradfieldK #complexity #fixpoint #logic: The Complexity of Independence-Friendly Fixpoint Logic (JCB, SK), pp. 355–368.
CSL-2005-CateF #complexity #hybrid #logic #on the: On the Complexity of Hybrid Logics with Binders (BtC, MF), pp. 339–354.
CSL-2005-Lambov #analysis #complexity #framework: Complexity and Intensionality in a Type-1 Framework for Computable Analysis (BL), pp. 442–461.
ICLP-2005-Wilson #logic programming: Use of Logic Programming for Complex Business Rules (WGW), pp. 14–20.
VMCAI-2005-KumarKV #complexity #fault #on the: On the Complexity of Error Explanation (NK, VK, MV), pp. 448–464.
DAC-2004-JerkeLS #design #layout: Reliability-driven layout decompaction for electromigration failure avoidance in complex mixed-signal IC designs (GJ, JL, JS), pp. 181–184.
DATE-DF-2004-AbrahamR #design #integration: Qualification and Integration of Complex I/O in SoC Design Flows (JA, GR), pp. 286–293.
DATE-v1-2004-BjesseK #abstraction #debugging #refinement #using: Using Counter Example Guided Abstraction Refinement to Find Complex Bugs (PB, JHK), pp. 156–161.
DATE-v1-2004-GuptaDGN #control flow #design #synthesis: Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow (SG, ND, RG, AN), pp. 114–121.
DATE-v1-2004-LaurentJSM #analysis #approach #functional #modelling #performance #power management: Functional Level Power Analysis: An Efficient Approach for Modeling the Power Consumption of Complex Processors (JL, NJ, ES, EM), pp. 666–667.
DATE-v1-2004-PostVRS #verification: A SystemC-Based Verification Methodology for Complex Wireless Software IP (GP, PKV, TR, DRS), pp. 544–551.
DocEng-2004-QuintV #authoring #documentation #xml: Techniques for authoring complex XML documents (VQ, IV), pp. 115–123.
PODS-2004-Calders #complexity #satisfiability: Computational Complexity of Itemset Frequency Satisfiability (TC), pp. 143–154.
PODS-2004-KaushikRC #optimisation #perspective #query: Synopses for Query Optimization: A Space-Complexity Perspective (RK, RR, VTC), pp. 201–209.
PODS-2004-MeyersonW #complexity #on the: On the Complexity of Optimal K-Anonymity (AM, RW), pp. 223–228.
SIGMOD-2004-LeeDDHD #database #named: iMAP: Discovering Complex Mappings between Database Schemas (RD, YL, AD, AYH, PMD), pp. 383–394.
VLDB-2004-SismanisR #complexity: The Complexity of Fully Materialized Coalesced Cubes (YS, NR), pp. 540–551.
ICSM-2004-MerloAPR #analysis #clone detection #complexity #detection #evolution #linear #object-oriented #similarity: Linear Complexity Object-Oriented Similarity for Clone Detection and Software Evolution Analyses (EM, GA, MDP, VFR), pp. 412–416.
ICSM-2004-MohanGL #approach #complexity #comprehension #concept #using: An Approach to Understanding Program Comprehensibility Using Spatial Complexity, Concept Assignment and Typographical Style (AM, NG, PJL), p. 530.
IWPC-2004-HammoudaGKS #diagrams #learning #modelling #uml: Tool-Supported Customization of UML Class Diagrams for Learning Complex System Models (IH, OG, KK, TS), pp. 24–33.
WCRE-2004-MohanGL #approach #complexity #concept #using: An Initial Approach to Assessing Program Comprehensibility Using Spatial Complexity, Number of Concepts and Typographical Style (AM, NG, PJL), pp. 246–255.
STOC-2004-Bar-YossefJK #communication #complexity #exponential #quantum: Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.
STOC-2004-BurgisserC #algebra #complexity #set: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets (PB, FC), pp. 475–485.
STOC-2004-FabrikantPT #complexity #nash: The complexity of pure Nash equilibria (AF, CHP, KT), pp. 604–612.
STOC-2004-SanthaS #quantum #query: Quantum and classical query complexities of local search are polynomially related (MS, MS), pp. 494–501.
CIAA-2004-BerstelC #algorithm #complexity #on the: On the Complexity of Hopcroft’s State Minimization Algorithm (JB, OC), pp. 35–44.
CIAA-2004-DaleyM #complexity #verification: Viral Gene Compression: Complexity and Verification (MD, IM), pp. 102–112.
CIAA-2004-EramianD #complexity #question: Does Hausdorff Dimension Measure Texture Complexity? (MGE, MD), pp. 317–318.
CIAA-2004-JirasekJS #complexity #regular expression: State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
CIAA-2004-KrawetzLS #complexity #finite #monad #set: State Complexity and the Monoid of Transformations of a Finite Set (BK, JL, JS), pp. 213–224.
DLT-2004-DowneyM #complexity: Some New Directions and Questions in Parameterized Complexity (RGD, CM), pp. 12–26.
DLT-2004-JurdzinskiOMP #automaton #complexity #on the: On the Complexity of 2-Monotone Restarting Automata (TJ, FO, FM, MP), pp. 237–248.
DLT-2004-Lohrey #automation #complexity #decidability #monad: Decidability and Complexity in Automatic Monoids (ML), pp. 308–320.
ICALP-2004-BulatovG #complexity: The Complexity of Partition Functions (AAB, MG), pp. 294–306.
ICALP-2004-Cheney #complexity #unification: The Complexity of Equivariant Unification (JC), pp. 332–344.
ICALP-2004-DurrHHM #complexity #graph #problem #quantum #query: Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.
ICALP-2004-KrauthgamerL #black box #complexity #nearest neighbour: The Black-Box Complexity of Nearest Neighbor Search (RK, JRL), pp. 858–869.
ICALP-2004-Lyngso #complexity #modelling #predict #pseudo: Complexity of Pseudoknot Prediction in Simple Models (RBL), pp. 919–931.
ICALP-2004-Serre #complexity #game studies: Games with Winning Conditions of High Borel Complexity (OS), pp. 1150–1162.
ICGT-2004-BohlenR #concept #graph transformation #specification: Concepts for Specifying Complex Graph Transformation Systems (BB, UR), pp. 96–111.
CHI-2004-KierasS #lessons learnt #modelling: Computational GOMS modeling of a complex team task: lessons learned (DEK, TPS), pp. 97–104.
ICEIS-v1-2004-Maciaszek #complexity #enterprise #information management: Managing Complexity of Enterprise Information Systems (LAM), p. IX-XIII.
ICEIS-v2-2004-DangerRB #approach #mining #named: Objectminer: A New Approach for Mining Complex Objects (RD, JRS, RBL), pp. 42–47.
ICEIS-v3-2004-Nobre #complexity #design #learning: Organisational Learning — Foundational Roots for Design for Complexity (ÂLN), pp. 85–93.
ECIR-2004-BellR #complexity #web: Searcher’s Assessments of Task Complexity for Web Searching (DJB, IR), pp. 57–71.
ECIR-2004-MoschittiB #classification: Complex Linguistic Features for Text Classification: A Comprehensive Study (AM, RB), pp. 181–196.
ICML-2004-ConitzerS #bound #communication #complexity #game studies #learning: Communication complexity as a lower bound for learning in games (VC, TS).
ICPR-v1-2004-KokareBC #image #retrieval: Rotated Complex Wavelet based Texture Features for Content Based Image Retrieval (MK, PKB, BNC), pp. 652–655.
ICPR-v3-2004-DuOSS #estimation: Reflectance Estimation from Motion under Complex Illumination (FD, TO, YS, AS), pp. 218–222.
ICPR-v4-2004-KamTEYW #automation #behaviour #recognition: Automated Recognition of Highly Complex Human Behavior (AHK, KAT, HLE, WYY, JW), pp. 327–330.
ICPR-v4-2004-KimPL #bound #using: Object Boundary Edge Selection Using Normal Direction Derivatives of a Contour in a Complex Scene (TYK, JP, SWL), pp. 755–758.
ICPR-v4-2004-LeoDGSD #monitoring #process #recognition: Complex Human Activity Recognition for Monitoring Wide Outdoor Environments (ML, TD, IG, PS, AD), pp. 913–916.
ICPR-v4-2004-WangJ #detection #multi: Multi-View Face Detection under Complex Scene based on Combined SVMs (PW, QJ), pp. 179–182.
KDD-2004-HeCH #approach #correlation #interface #mining #query #web: Discovering complex matchings across web query interfaces: a correlation mining approach (BH, KCCC, JH), pp. 148–157.
KDD-2004-LazarevicKK #detection #effectiveness #locality #scalability: Effective localized regression for damage detection in large complex mechanical structures (AL, RK, CK), pp. 450–459.
KDD-2004-TruongLB #dataset #learning #random #using: Learning a complex metabolomic dataset using random forests and support vector machines (YT, XL, CB), pp. 835–840.
KDD-2004-Yang #complexity #mining: The complexity of mining maximal frequent itemsets and maximal frequent patterns (GY), pp. 344–353.
KR-2004-Brewka #optimisation #set: Complex Preferences for Answer Set Optimization (GB), pp. 213–223.
KR-2004-EiterFFPW #bound #complexity #model checking #programming #set: Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.
KR-2004-Provan #abduction #complexity #modelling: Inferential Complexity Control for Model-Based Abduction (GMP), pp. 415–426.
KR-2004-ZhangZ #integer #problem #scheduling: An Improved Integer Local Search for Complex Scheduling Problems (WZ, XZ), pp. 692–700.
PADL-2004-Fall #declarative #nondeterminism: Supporting Decisions in Complex, Uncertain Domains with Declarative Languages (AF), pp. 16–22.
SAC-2004-QiW #mining #set: A model for mining outliers from complex data sets (HQ, JW), pp. 595–599.
ICSE-2004-Berenbach #analysis #design #evaluation #scalability #uml: The Evaluation of Large, Complex UML Analysis and Design Model (BB), pp. 232–241.
ICSE-2004-Lieberherr #complexity #design: Controlling the Complexity of Software Design (KJL), pp. 2–11.
CGO-2004-DupreDT #architecture #embedded #named: VHC: Quickly Building an Optimizer for Complex Embedded Architectures (MD, ND, OT), pp. 53–64.
HPCA-2004-AbellaG #distributed #queue: Low-Complexity Distributed Issue Queue (JA, AG), pp. 73–83.
HPCA-2004-ChenYFM #effectiveness #predict: Accurate and Complexity-Effective Spatial Pattern Prediction (CFC, SHY, BF, AM), pp. 276–287.
HPCA-2004-FalconRV #multi #thread: A Low-Complexity, High-Performance Fetch Unit for Simultaneous Multithreading Processors (AF, AR, MV), pp. 244–253.
CSL-2004-Atserias #complexity #random #satisfiability: Notions of Average-Case Complexity for Random 3-SAT (AA), pp. 1–5.
LICS-2004-NordhJ #algebra #approach #complexity: An Algebraic Approach to the Complexity of Propositional Circumscription (GN, PJ), pp. 367–376.
SAT-2004-BaulandCCHV #algebra #approach #complexity #query: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 181–190.
VMCAI-2004-ClarkeKOS #bound #complexity #model checking: Completeness and Complexity of Bounded Model Checking (EMC, DK, JO, OS), pp. 85–96.
DAC-2003-KiranJRN #behaviour #communication #complexity #effectiveness #modelling: A complexity effective communication model for behavioral modeling of signal processing applications (MNVSK, MNJ, PR, SKN), pp. 412–415.
DATE-2003-AndritsopoulosCDKMPTPR #case study #verification: Verification of a Complex SoC: The PRO3 Case-Study (FA, CC, GD, FK, YM, FP, IT, SP, DIR), pp. 20224–20231.
DATE-2003-BruschiF #behaviour #modelling #synthesis: Synthesis of Complex Control Structures from Behavioral SystemC Models (FB, FF), pp. 20112–20119.
DocEng-2003-MongB #using #visual notation #web: Using SVG as the rendering model for structured and graphically complex web material (JCM, DFB), pp. 88–91.
ICDAR-2003-AmanoA #analysis #documentation #grammarware #graph grammar: Graph Grammar Based Analysis System of Complex Table Form Document (AA, NA), pp. 916–920.
ICDAR-2003-MarukatatSAG #flexibility #online #recognition: A Flexible Recognition Engine for Complex On-line Handwritten Character Recognition (SM, RS, TA, PG), pp. 1048–1052.
ICDAR-2003-ShiG #detection #documentation #fuzzy #image #using: Skew Detection for Complex Document Images Using Fuzzy Runlength (ZS, VG), pp. 715–719.
PODS-2003-CaliLR #complexity #consistency #database #decidability #on the #query #semistructured data: On the decidability and complexity of query answering over inconsistent and incomplete databases (AC, DL, RR), pp. 260–271.
PODS-2003-GottlobKP #complexity #evaluation #query #xpath: The complexity of XPath query evaluation (GG, CK, RP), pp. 179–190.
PODS-2003-Segoufin #bound #complexity #documentation #query #type system #xml: Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.
SIGMOD-2003-ChaudhuriGS #query: Factorizing Complex Predicates in Queries to Exploit Indexes (SC, PG, SS), pp. 361–372.
VLDB-2003-RaghavanG #query #repository #web: Complex Queries over Web Repositories (SR, HGM), pp. 33–44.
IWPC-2003-RillingK #complexity #comprehension #identification #metric #slicing #using: Identifying Comprehension Bottlenecks Using Program Slicing and Cognitive Complexity Metric (JR, TK), pp. 115–124.
SAS-2003-FieldGRY #abstraction #complexity #type system #verification: Typestate Verification: Abstraction Techniques and Complexity Results (JF, DG, GR, EY), pp. 439–462.
STOC-2003-Gurvits #complexity #problem #quantum: Classical deterministic complexity of Edmonds’ Problem and quantum entanglement (LG), pp. 10–19.
STOC-2003-JayramKS #complexity: Two applications of information complexity (TSJ, RK, DS), pp. 673–682.
STOC-2003-RettingerW #complexity #set: The computational complexity of some julia sets (RR, KW), pp. 177–185.
CIAA-2003-GuingneKN #automaton #complexity: Running Time Complexity of Printing an Acyclic Automaton (FG, AK, FN), pp. 131–140.
CIAA-2003-Trakhtman #complexity #testing: Reducing the Time Complexity of Testing for Local Threshold Testability (AT), pp. 141–149.
CIAA-2003-XieLD #complexity #equation #linear #problem #using: New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.
DLT-2003-Vollmer #complexity: Complexity Theory Made Easy (HV), pp. 95–110.
ICALP-2003-ChenKPSX #complexity #graph #problem: Genus Characterizes the Complexity of Graph Problems: Some Tight Results (JC, IAK, LP, ES, GX), pp. 845–856.
ICALP-2003-FialaP #complexity #problem: The Computational Complexity of the Role Assignment Problem (JF, DP), pp. 817–828.
ICALP-2003-GalM #complexity #data type: The Cell Probe Complexity of Succinct Data Structures (AG, PBM), pp. 332–344.
ICALP-2003-HallHS #algorithm #complexity #multi #performance: Multicommodity Flows over Time: Efficient Algorithms and Complexity (AH, SH, MS), pp. 397–409.
ICALP-2003-HitchcockLM #complexity: Scaled Dimension and Nonuniform Complexity (JMH, JHL, EM), pp. 278–290.
ICALP-2003-JainRS #communication #complexity #theorem: A Direct Sum Theorem in Communication Complexity via Message Compression (RJ, JR, PS), pp. 300–315.
FME-2003-BozzanoCCVV #assessment #case study #industrial #safety: Improving Safety Assessment of Complex Systems: An Industrial Case Study (MB, AC, MC, LV, AV), pp. 208–222.
CHI-2003-SalvucciL #architecture #modelling: Simple cognitive modeling in a complex cognitive architecture (DDS, FJL), pp. 265–272.
VISSOFT-2003-Hamou-LhadjL #complexity #execution #object-oriented: Techniques for Reducing the Complexity of Object-Oriented Execution Traces (AHL, TCL), pp. 35–40.
CAiSE-2003-GeneroP #complexity #diagrams #metric #uml: No-redundant Metrics for UML Class Diagram Structural Complexity (MEM, MG, MP), pp. 127–142.
ICEIS-v1-2003-KamburR #database: Storage of Complex Business Rules in Object Databases (DK, MR), pp. 294–299.
ICEIS-v3-2003-HawryszkiewyczG #complexity #process: Managing the Complexity of Emergent Processes (IH, SG), pp. 319–325.
CIKM-2003-YangRK #complexity #on the #web: On the complexity of schema inference from web pages in the presence of nullable data attributes (GY, IVR, MK), pp. 224–231.
MLDM-2003-KostersPP #analysis #complexity #implementation: Complexity Analysis of Depth First and FP-Growth Implementations of APRIORI (WAK, WP, VP), pp. 284–292.
SEKE-2003-LongoAFG #architecture #multi: A Layered Architecture to Manage Complex Multimedia Services (ML, PA, AF, NG), pp. 414–421.
POPL-2003-Chakaravarthy #analysis #complexity: New results on the computability and complexity of points — to analysis (VTC), pp. 115–125.
SAC-2003-SiEHD #composition #configuration management #process: A Model for the Configurable Composition and Synchronization of Complex Trading Activities (YWS, DE, AHMtH, MD), pp. 595–602.
HPCA-2003-Jimenez #branch #predict: Reconsidering Complex Branch Predictors (DAJ), pp. 43–52.
CADE-2003-LutzST #complexity #finite #logic #reasoning: The Complexity of Finite Model Reasoning in Description Logics (CL, US, LT), pp. 60–74.
CSL-2003-BornerBJK #algorithm #complexity #constraints #quantifier: Quantified Constraints: Algorithms and Complexity (FB, AAB, PJ, AAK), pp. 58–70.
CSL-2003-DantchevR #complexity #on the: On Relativisation and Complexity Gap (SSD, SR), pp. 142–154.
CSL-2003-Gerhardy #analysis #complexity: Refined Complexity Analysis of Cut Elimination (PG), pp. 212–225.
CSL-2003-HitchcockLT #complexity: The Arithmetical Complexity of Dimension and Randomness (JMH, JHL, ST), pp. 241–254.
CSL-2003-KahlerW #complexity #ltl #model checking: Program Complexity of Dynamic LTL Model Checking (DK, TW), pp. 271–284.
CSL-2003-KolaitisP #complexity #game studies #on the: On the Complexity of Existential Pebble Games (PGK, JP), pp. 314–329.
CSL-2003-MaksimovaV #calculus #complexity #problem: Complexity of Some Problems in Modal and Intuitionistic Calculi (LM, AV), pp. 397–412.
ICLP-2003-WuPR #complexity #logic programming #on the: On the Complexity of Dependent And-Parallelism in Logic Programming (YW, EP, DR), pp. 361–376.
LICS-2003-Buresh-OppenheimP #complexity: The Complexity of Resolution Refinements (JBO, TP), p. 138–?.
RTA-2003-SalvatiG #complexity #higher-order #linear #on the #λ-calculus: On the Complexity of Higher-Order Matching in the Linear λ-Calculus (SS, PdG), pp. 234–245.
VMCAI-2003-BraghinCFLP #analysis #complexity #mobile: Complexity of Nesting Analysis in Mobile Ambients (CB, AC, RF, FLL, CP), pp. 86–101.
ASE-2002-Goldmann #development: A Model of Planning and Enactment Support in Complex Software Development Projects (SG), p. 311.
DAC-2002-KoukabDD #analysis #named #performance: HSpeedEx: a high-speed extractor for substrate noise analysis in complex mixed signal SOC (AK, CD, MJD), pp. 767–770.
DAC-2002-PeymandoustMS #algebra #embedded #library #using: Complex library mapping for embedded software using symbolic algebra (AP, GDM, TS), pp. 325–330.
DATE-2002-CarmonaJDER #design #programmable: Bio-Inspired Analog VLSI Design Realizes Programmable Complex Spatio-Temporal Dynamics on a Single Chip (RCG, FJG, RDC, SEM, ÁRV), pp. 362–366.
DATE-2002-Man #complexity #integration #on the: On Nanoscale Integration and Gigascale Complexity in the Post.Com World (HDM), p. 12.
DATE-2002-PenaCSP #case study #verification: A Case Study for the Verification of Complex Timed Circuits: IPCMOS (MAP, JC, ABS, EP), pp. 44–51.
PODS-2002-ChatterjiEGY #approximate #complexity #on the #optimisation #query: On the Complexity of Approximate Query Optimization (SC, SSKE, SG, MDY), pp. 282–292.
SIGMOD-2002-DobraGGR #data type #query: Processing complex aggregate queries over data streams (AD, MNG, JG, RR), pp. 61–72.
ESOP-2002-NielsonNS #analysis #automation #complexity: Automatic Complexity Analysis (FN, HRN, HS), pp. 243–261.
ICSM-2002-Tran-CaoLA #complexity #effectiveness #functional #metric #towards: Measuring Software Functional Size: Towards an Effective Measurement of Complexity (DTC, GL, AA), pp. 370–376.
ICSM-2002-WilkieH #complexity #object-oriented #tool support: Tool Support for Measuring Complexity in Heterogeneous Object-Oriented Software (FGW, TJH), pp. 152–161.
STOC-2002-BatuDKR #approximate #complexity: The complexity of approximating entropy (TB, SD, RK, RR), pp. 678–687.
STOC-2002-BeameV #communication #complexity #multi #nearest neighbour #problem #trade-off: Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems (PB, EV), pp. 688–697.
STOC-2002-CharikarLLPPRSS #approximate #complexity #modelling: Approximating the smallest grammar: Kolmogorov complexity in natural models (MC, EL, DL, RP, MP, AR, AS, AS), pp. 792–801.
STOC-2002-DengPS #complexity #on the: On the complexity of equilibria (XD, CHP, SS), pp. 67–71.
STOC-2002-Feige #approximate #complexity: Relations between average case complexity and approximation complexity (UF), pp. 534–543.
STOC-2002-GoldbergKP #complexity #random: The complexity of choosing an H-colouring (nearly) uniformly at random (LAG, SK, MP), pp. 53–62.
STOC-2002-Raz #complexity #matrix #on the: On the complexity of matrix product (RR), pp. 144–151.
STOC-2002-Sivakumar #algorithm #complexity: Algorithmic derandomization via complexity theory (DS), pp. 619–626.
CIAA-J-2000-PighizziniS02 #complexity: Unary Language Operations, State Complexity and Jacobsthal’s Function (GP, JS), pp. 145–159.
CIAA-2002-HolzerK #automaton #complexity #finite #nondeterminism: State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.
DLT-2002-Adorna #nondeterminism #on the: On the Separation between k-Party and (k-1)-Party Nondeterministic Message Complexities (HNA), pp. 152–161.
DLT-2002-Cassaigne #complexity #infinity #word: Constructing Infinite Words of Intermediate Complexity (JC), pp. 173–184.
DLT-2002-DassowNR #complexity #on the: On the Descriptional Complexity of Some Variants of Lindenmayer Systems (JD, TYN, BR), pp. 128–139.
DLT-2002-HolzerK #complexity #nondeterminism: Unary Language Operations and Their Nondeterministic State Complexity (MH, MK), pp. 162–172.
ICALP-2002-EstebanGM #bound #complexity #on the: On the Complexity of Resolution with Bounded Conjunctions (JLE, NG, JM), pp. 220–231.
ICALP-2002-FotakisKKMS #complexity #game studies #nash: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game (DF, SCK, EK, MM, PGS), pp. 123–134.
ICALP-2002-HitchcockL #complexity #strict #why: Why Computational Complexity Requires Stricter Martingales (JMH, JHL), pp. 549–560.
ICALP-2002-Marathe #complexity #predict #towards: Towards a Predictive Computational Complexity Theory (MVM), pp. 22–31.
ICALP-2002-Nisan #approximate #communication #complexity #set: The Communication Complexity of Approximate Set Packing and Covering (NN), pp. 868–875.
CHI-2002-LinTL #design #interactive #scalability #sketching #visual notation: A visual language for sketching large and complex interactive designs (JL, MT, JAL), pp. 307–314.
VISSOFT-2002-RillingSB #analysis #complexity #concept #source code #visualisation: The CONCEPT Project — Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques (JR, AS, CB), p. 90.
CAiSE-2002-IvanDP #approach #complexity #design #middleware #protocol #using: Managing Complexity of Designing Routing Protocols Using a Middleware Approach (CI, VD, KP), pp. 737–741.
ICEIS-2002-TanL #approach #query: A Hierarchical Approach to Complex Data Cube Queries (RBNT, GL), pp. 187–194.
ICPR-v1-2002-ArakiSS #detection: Detection of Faces of Various Directions in Complex Backgrounds (YA, NS, YS), pp. 409–412.
ICPR-v1-2002-NguyenVWB #behaviour #monitoring #multi #people #using: Hierarchical Monitoring of People’s Behaviors in Complex Environments Using Multiple Cameras (NTN, SV, GAWW, HHB), pp. 13–16.
ICPR-v1-2002-WangQ #complexity #recognition #using: Face Recognition Using Optimal Non-Orthogonal Wavelet Basis Evaluated by Information Complexity (XW, HQ), pp. 164–167.
ICPR-v1-2002-YuanGY #detection #robust: Robust Frontal Face Detection in Complex Environment (QY, WG, HY), pp. 25–28.
ICPR-v2-2002-AnconaCSD #complexity #detection #image #parametricity #runtime: Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines (NA, GC, ES, AD), pp. 426–429.
ICPR-v2-2002-PolatYS #multi #using: Multiple Complex Object Tracking Using A Combined Technique (EP, MY, RS), pp. 717–720.
ICPR-v2-2002-RidderPD #classification #complexity #fault: The Economics of Classification: Error vs. Complexity (DdR, EP, RPWD), pp. 244–247.
ICPR-v3-2002-GotoA #documentation: Character Pattern Extraction from Colorful Documents with Complex Backgrounds (HG, HA), pp. 180–183.
ICPR-v3-2002-HsiehYC #detection: Morphology-Based License Plate Detection from Complex Scenes (JWH, SHY, YSC), pp. 176–179.
ICPR-v3-2002-KimKRK #image #robust: A Robust License-Plate Extraction Method under Complex Image Conditions (SK, DK, YR, GK), pp. 216–219.
ICPR-v4-2002-ChenOB #markov #random #recognition #segmentation: Text Segmentation and Recognition in Complex Background Based on Markov Random Field (DC, JMO, HB), pp. 227–230.
KDD-2002-HultenD #constant #database #mining #modelling #scalability: Mining complex models from arbitrarily large databases in constant time (GH, PMD), pp. 525–531.
KR-2002-BaralZ #complexity #model checking: The Complexity of Model Checking for Knowledge Update (CB, YZ), pp. 82–96.
KR-2002-BeygelzimerR #complexity #learning #network: Inference Complexity as a Model-Selection Criterion for Learning Bayesian Networks (AB, IR), pp. 558–567.
KR-2002-Coste-MarquisM #complexity: Complexity Results for Paraconsistent Inference Relations (SCM, PM), pp. 61–72.
KR-2002-EiterL #approach #complexity: Complexity Results for Explanations in the Structural-Model Approach (TE, TL), pp. 49–60.
KR-2002-Fruhwirth #analysis #automation #complexity: As Time Goes by: Automatic Complexity Analysis of Simplified Rules (TWF), pp. 547–557.
KR-2002-KoniecznyLM #complexity #distance #framework: Distance Based Merging: A General Framework and some Complexity Results (SK, JL, PM), pp. 97–108.
SEKE-2002-Ginige #complexity #development #web: Web engineering: managing the complexity of web systems development (AG), pp. 721–729.
CADE-2002-KupfermanSV #calculus #complexity: The Complexity of the Graded µ-Calculus (OK, US, MYV), pp. 423–437.
CAV-2002-Jacobi #model checking #pipes and filters #verification: Formal Verification of Complex Out-of-Order Pipelines by Combining Model-Checking and Theorem-Proving (CJ0), pp. 309–323.
CSL-2002-Leivant #complexity: Implicit Computational Complexity for Higher Type Functionals (DL), pp. 367–381.
CSL-2002-MarcinkowskiT #bound #complexity #game studies #ltl: Optimal Complexity Bounds for Positive LTL Games (JM, TT), pp. 262–275.
LICS-2002-Cook #complexity #proving: Complexity Classes, Propositional Proof Systems, and Formal Theories (SAC), p. 311.
LICS-2002-FrickG #complexity #first-order #higher-order #logic #monad #revisited: The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
LICS-2002-HesseI #complexity #problem: Complete Problems for Dynamic Complexity Classes (WH, NI), p. 313–?.
LICS-2002-SoltysC #algebra #complexity #linear #proving: The Proof Complexity of Linear Algebra (MS, SAC), pp. 335–344.
SAT-2002-BueningX #complexity #morphism #satisfiability: The complexity of homomorphisms and renamings of minimal unsatisfiable formulas (HKB, DX), p. 9.
WICSA-2001-KloukinasI #architecture: SPIN-ning Software Architectures: A Method for Exploring Complex (CK, VI), pp. 67–76.
DAC-2001-GizdarskiF #complexity #framework #learning: A Framework for Low Complexity Static Learning (EG, HF), pp. 546–549.
DAC-2001-KohnoM #behaviour #pipes and filters #verification: A New Verification Methodology for Complex Pipeline Behavior (KK, NM), pp. 816–821.
DAC-2001-MneimnehAWCSA #hybrid #scalability #verification: Scalable Hybrid Verification of Complex Microprocessors (MNM, FAA, CTW, SC, KAS, TMA), pp. 41–46.
DATE-2001-NeauMR #complexity #using: Low complexity FIR filters using factorization of perturbed coefficients (CN, KM, KR), pp. 268–272.
DATE-2001-VanasscheGS #exponential #performance #simulation #using: Efficient time-domain simulation of telecom frontends using a complex damped exponential signal model (PV, GGEG, WMCS), pp. 169–175.
DocEng-2001-Silberhorn #approach #named: TabulaMagica: an integrated approach to manage complex tables (HS), pp. 68–75.
ICDAR-2001-AntonacopoulosK #information management: Information Extraction from Complex Circular Charts (AA, DPK), pp. 784–789.
ICDAR-2001-JinT #composition #locality #using: Text Area Localization under Complex-Background Using Wavelet Decomposition (NJ, YYT), pp. 1126–1130.
ICDAR-2001-PietikainenO #detection #documentation #image: Edge-Based Method for Text Detection from Complex Document Images (MP, OO), pp. 286–291.
ICDAR-2001-SetlurGSL #evaluation #testing: Truthing, Testing and Evaluation Issues in Complex Systems (SS, VG, SNS, AL), p. 1205–?.
ICDAR-2001-TsuruokaTYST #image #segmentation: Region Segmentation for Table Image with Unknown Complex Structure (ST, TT, TY, TS, KT), pp. 709–715.
PODS-2001-CaiCKN #complexity #on the: On the Complexity of Join Predicates (JyC, VTC, RK, JFN).
PODS-2001-Grohe #complexity #database #query: The Parameterized Complexity of Database Queries (MG), pp. 82–92.
VLDB-2001-BohmMSW #evaluation #performance #query #similarity: Fast Evaluation Techniques for Complex Similarity Queries (KB, MM, HJS, RW), pp. 211–220.
ESOP-2001-Muller-OlmR #complexity #constant #on the: On the Complexity of Constant Propagation (MMO, OR), pp. 190–205.
FoSSaCS-2001-CharatonikDGMT #complexity #mobile #model checking: The Complexity of Model Checking Mobile Ambients (WC, SDZ, ADG, SM, JMT), pp. 152–167.
FoSSaCS-2001-KingKV #automaton #complexity #on the #word: On the Complexity of Parity Word Automata (VK, OK, MYV), pp. 276–286.
CSMR-2001-MarburgerH #comprehension #legacy: E-CARES Project: Understanding Complex Legacy Telecommunication Systems (AM, DH), pp. 139–147.
ICSM-2001-ZelkowitzR #independence #maintenance #safety #validation #verification: The Role of Independent Verification and Validation in Maintaining a Safety Critical Evolutionary Software in a Complex Environment: The NASA Space Shuttle Program (MVZ, IR), pp. 118–126.
STOC-2001-AchlioptasBM #complexity #proving: A sharp threshold in proof complexity (DA, PB, MSOM), pp. 337–346.
STOC-2001-AraiPU #complexity: The complexity of analytic tableaux (NHA, TP, AU), pp. 356–363.
STOC-2001-BulatovKJ #complexity #constraints: The complexity of maximal constraint languages (AAB, AAK, PJ), pp. 667–674.
STOC-2001-DurandLS: Complex tilings (BD, LAL, AS), pp. 732–739.
STOC-2001-GennaroIKR #complexity #multi: The round complexity of verifiable secret sharing and secure multicast (RG, YI, EK, TR), pp. 580–589.
STOC-2001-GoemansW #algorithm #approximate #problem #programming: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (MXG, DPW), pp. 443–452.
STOC-2001-IckingM #3d #bound #complexity #diagrams #distance: A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (CI, LM), pp. 316–321.
STOC-2001-KlauckNTZ #communication #complexity #interactive #quantum #set: Interaction in quantum communication and the complexity of set disjointness (HK, AN, ATS, DZ), pp. 124–133.
STOC-2001-Pagh #complexity #on the: On the cell probe complexity of membership and perfect hashing (RP), pp. 425–432.
STOC-2001-Yao #complexity: Some perspective on computational complexity (abstract) (ACCY), p. 600.
DLT-2001-Lischke #complexity: The Root of a Language and Its Complexity (GL), pp. 272–280.
DLT-2001-Razborov #complexity #proving: Proof Complexity of Pigeonhole Principles (AAR), pp. 100–116.
ICALP-2001-AlberFN #complexity #exponential #graph #problem: Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.
ICALP-2001-BrodalFPO #complexity #using: The Complexity of Constructing Evolutionary Trees Using Experiments (GSB, RF, CNSP, AÖ), pp. 140–151.
ICALP-2001-ChakrabartiK #bound #complexity #graph #random: Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.
ICALP-2001-HemaspaandraKW #complexity: The Complexity of Computing the Size of an Interval (LAH, SK, KWW), pp. 1040–1051.
ICALP-2001-HoyerNS #order #quantum #sorting: Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness (PH, JN, YS), pp. 346–357.
FME-2001-IglesiasGCNF #case study #protocol #prototype #specification: From Complex Specifications to a Working Prototype. A Protocol Engineering Case Study (MJFI, FJGC, JMPC, MLN, ARF), pp. 436–448.
CHI-2001-BhavnaniRJ #education #identification #using: Beyond command knowledge: identifying and teaching strategic knowledge for using complex computer applications (SKB, FR, BEJ), pp. 229–236.
AdaEurope-2001-CrespoBT #ada #implementation: Complex Task Implementation in Ada (AC, PB, ST), pp. 167–178.
EDOC-2001-WegmannN #concept #modelling #ontology #using: Conceptual Modeling of Complex Systems Using an RM-ODP Based Ontology (AW, AN), pp. 200–211.
ICEIS-v2-2001-ArevaloCQAV #analysis #corba #design #framework #industrial #web: A CORBA and Web Technology Based Framework for the Analysis and Optimal Design of Complex Systems in the Oil Industry (CJA, JAC, NVQ, NA, JV), pp. 953–961.
OOPSLA-2001-Nakamura #incremental #query: Incremental Computation of Complex Objects Queries (HN), pp. 156–165.
QAPL-2001-Fruhwirth #analysis #automation #complexity #concurrent #source code: As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs (TWF), pp. 185–206.
RE-2001-Sutcliffe #collaboration #requirements: Requirements Engineering for Complex Collaborative Systems (AGS), pp. 110–119.
ESEC-FSE-2001-LippertR #adaptation #agile: Adapting XP to complex application domains (ML, SR), pp. 316–317.
ICSE-2001-ZelkowitzR #comprehension #safety: Understanding IV & V in a Safety Critical and Complex Evolutionary Environment: The NASA Space Shuttle Program (MVZ, IR), pp. 349–357.
HPDC-2001-LopezO #evaluation #network: Evaluation of a Resource Selection Mechanism for Complex Network Services (JCL, DRO), pp. 171–180.
CAV-2001-AnnichiniBS #analysis #named #reachability: TReX: A Tool for Reachability Analysis of Complex Systems (AA, AB, MS), pp. 368–372.
CSL-2001-ChenS #complexity: Capture Complexity by Partition (YC, ES), pp. 84–98.
ICLP-2001-LoncT #complexity #logic programming #parametricity #semantics #source code: Fixed-Parameter Complexity of Semantics for Logic Programs (ZL, MT), pp. 197–211.
IJCAR-2001-GanzingerM #bottom-up #logic programming #source code #theorem: A New Meta-complexity Theorem for Bottom-Up Logic Programs (HG, DAM), pp. 514–528.
IJCAR-2001-LynchM #complexity #decidability #equation #linear: Decidability and Complexity of Finitely Closable Linear Equational Theories (CL, BM), pp. 499–513.
LICS-2001-KirousisK #complexity: A Dichotomy in the Complexity of Propositional Circumscription (LMK, PGK), pp. 71–80.
RTA-2001-Lohrey #automaton #complexity #on the #parallel: On the Parallel Complexity of Tree Automata (ML), pp. 201–215.
SAT-2001-HuntMS #complexity #constraints #probability #problem #quantifier: Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems (HBHI, MVM, RES), pp. 217–230.
TLCA-2001-Hofmann #behaviour #bound #complexity #memory management #type system: From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour (MH0), pp. 2–3.
TLCA-2001-Schubert #complexity #order: The Complexity of β-Reduction in Low Orders (AS), pp. 400–414.
DAC-2000-JainMMWL #analysis #canonical #complexity #composition #graph #how: Analysis of composition complexity and how to obtain smaller canonical graphs (JJ, KM, DM, IW, YL), pp. 681–686.
DAC-2000-QiuWP #petri net #power management #probability #using: Dynamic power management of complex systems using generalized stochastic Petri nets (QQ, QW, MP), pp. 352–356.
DATE-2000-SousaA #clustering #complexity #fault #modelling #using: Reducing the Complexity of Defect Level Modeling Using the Clustering Effect (JTdS, VDA), pp. 640–644.
PODS-2000-DantsinV #complexity #query: Expressive Power and Data Complexity of Query Languages for Trees and Lists (ED, AV), pp. 157–165.
SIGMOD-2000-ZaharioudakisCLPU #automation #query #sql #summary #using: Answering Complex SQL Queries Using Automatic Summary Tables (MZ, RC, GL, HP, MU), pp. 105–116.
VLDB-2000-LaneEN #agile #challenge #database #development #scalability: Biodiversity Informatics: The Challenge of Rapid Development, Large Databases, and Complex Data (Keynote) (MAL, JLE, EN), pp. 729–732.
STOC-2000-AlekhnovichBRW #calculus #complexity: Space complexity in propositional calculus (MA, EBS, AAR, AW), pp. 358–367.
STOC-2000-CramerDD #complexity #multi #on the: On the complexity of verifiable secret sharing and multiparty computation (RC, ID, SD), pp. 325–334.
STOC-2000-Furer #approximate #matrix: Approximating permanents of complex matrices (MF), pp. 667–669.
STOC-2000-RothemundW #complexity #self: The program-size complexity of self-assembled squares (extended abstract) (PWKR, EW), pp. 459–468.
STOC-2000-SamorodnitskyT #complexity #query: A PCP characterization of NP with optimal amortized query complexity (AS, LT), pp. 191–199.
STOC-2000-Vadhan #complexity #interactive #on the #proving: On transformation of interactive proofs that preserve the prover’s complexity (SPV), pp. 200–207.
CIAA-2000-Neto #adaptation #automaton #problem: Solving Complex Problems Efficiently with Adaptive Automata (JJN), pp. 340–342.
CIAA-2000-Pighizzini #complexity: Unary Language Concatenation and Its State Complexity (GP), pp. 252–262.
CIAA-2000-Shallit #complexity: State Complexity and Jacobsthal’s Function (JS), pp. 272–278.
CIAA-2000-Wareham #automaton #complexity #composition #finite #set: The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata (TW), pp. 302–310.
ICALP-2000-AkhaviV #algorithm: Average Bit-Complexity of Euclidean Algorithms (AA, BV), pp. 373–387.
ICALP-2000-Mayr #bisimulation #complexity #on the #parallel #problem #process: On the Complexity of Bisimulation Problems for Basic Parallel Processes (RM), pp. 329–341.
WLC-2000-AvgustinovichFF #complexity #infinity #word: Arithmetical Complexity of Infinite Words (SVA, DFDF, AEF), pp. 51–62.
ICEIS-2000-KalininNSP #network #process: Usage of Instrument of Neural Networks in Control of Complex Chemical-Technological Processes (AK, LN, ES, SP), pp. 521–524.
CIKM-2000-LiFK #retrieval: Structural Join Index Driven Complex Object Retrieval: Mechanisms and Selection (QL, CWF, KK), pp. 150–157.
ICML-2000-BowersGL #classification: Classification of Individuals with Complex Structure (AFB, CGGC, JWL), pp. 81–88.
ICPR-v1-2000-ChengDHT #detection #performance: Efficient Detection and Extraction of Color Objects from Complex Scenes (JC, SD, GH, JT), pp. 1668–1671.
ICPR-v2-2000-AokiK #image #using: An Image Storage System Using Complex-Valued Associative Memories (HA, YK), pp. 2626–2629.
ICPR-v2-2000-Baram #pattern matching #pattern recognition #random #recognition: Random Embedding Machines for Low-Complexity Pattern Recognition (YB), pp. 2748–2754.
ICPR-v2-2000-HoB #classification #complexity #problem: Measuring the Complexity of Classification Problems (TKH, MB), pp. 2043–2047.
ICPR-v2-2000-KeglKN #classification #complexity #learning #network: Radial Basis Function Networks and Complexity Regularization in Function Learning and Classification (BK, AK, HN), pp. 2081–2086.
ICPR-v4-2000-WatanabeS #analysis #documentation #layout: Layout Analysis of Complex Documents (TW, TS), pp. 4447–4450.
KR-2000-EiterL #complexity #knowledge base #reasoning: Complexity Results for Default Reasoning from Conditional Knowledge Bases (TE, TL), pp. 62–73.
KR-2000-MorrisM #complexity #on the #reasoning: On the complexity of reasoning about repeating events (RAM, PHM), pp. 580–588.
TOOLS-ASIA-2000-ZhangFZ #database #design #web: Role-Based Database Designing for Managing Complex Objects and Their Relationships on the Web (YZ, JF, LZ), pp. 212–219.
TOOLS-USA-2000-BenyahiaH #adaptation #development #distributed #framework: An Adaptive Framework for Distributed Complex Applications Development (IB, MH), p. 339–?.
POPL-2000-MuthD #analysis #complexity #data flow #on the: On the Complexity of Flow-Sensitive Dataflow Analyses (RM, SKD), pp. 67–80.
ICRE-2000-NguyenS #complexity #modelling #requirements: Essential and Incidental Complexity in Requirements Models (LN, PAS), pp. 130–139.
SAC-2000-CeriCDFT #query: Complex Queries in XML-GL (SC, SC, ED, PF, LT), pp. 888–893.
LCTES-2000-BuddeP #modelling: Complex Reactive Control with Simple Synchronous Models (RB, AP), pp. 19–32.
CL-2000-BaralTTK #complexity: Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States (CB, LCT, RT, VK), pp. 882–896.
CL-2000-DekhtyarDD #complexity #constraints #on the: On Complexity of Updates through Integrity Constraints (MID, AJD, SD), pp. 867–881.
CSL-2000-Atserias #bound #complexity #fixpoint: The Descriptive Complexity of the Fixed-Points of Bounded Formulas (AA), pp. 172–186.
CSL-2000-Blumensath #bound #complexity: Bounded Arithmetic and Descriptive Complexity (AB), pp. 232–246.
CSL-2000-Kuznets #complexity #logic #on the: On the Complexity of Explicit Modal Logics (RK), pp. 371–383.
CSL-2000-MakowskyM #combinator #complexity #generative #graph #on the: On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale (JAM, KM), pp. 399–410.
LICS-2000-BergmanS #algebra #complexity #problem: Computational Complexity of Some Problems Involving Congruences on Algebras (CB, GS), pp. 168–174.
LICS-2000-Fagin #complexity #game studies #logic: Logic, Complexity, and Games (RF), p. 3.
DAC-1999-ClementHLRCP #design #multi #performance #prototype: Fast Prototyping: A System Design Flow Applied to a Complex System-on-Chip Multiprocessor Design (BC, RH, EL, BR, PC, FP), pp. 420–424.
DAC-1999-DaemsGS #analysis #complexity #reduction: Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits (WD, GGEG, WMCS), pp. 958–963.
DATE-1999-Junkkari #challenge #complexity #design #development #testing: Higher Product Complexity and Shorter Development Time — Continuous Challenge to Design and Test Environment (JJ), pp. 2–3.
DATE-1999-SmithM #component #polynomial: Polynomial Methods for Allocating Complex Components (JS, GDM), pp. 217–222.
ICDAR-1999-YeCS #modelling: Model-based Character Extraction from Complex Backgrounds (XY, MC, CYS), pp. 511–514.
PODS-1999-Cosmadakis #complexity #query #recursion: Inherent Complexity of Recursive Queries (Extended Abstract) (SSC), pp. 148–154.
PODS-1999-KarloffM #complexity #on the #problem: On the Complexity of the View-Selection Problem (HJK, MM), pp. 167–173.
ITiCSE-1999-SternSN #algorithm #animation #complexity: A strategy for managing content complexity in algorithm animation (LS, HS, LN), pp. 127–130.
IWPC-1999-SneedD #distributed #object-oriented: Comprehending a Complex, Distributed, Object-Oriented Software System a Report from the Field (HMS, TD), pp. 218–225.
SAS-1999-McAllester #analysis #complexity #on the: On the Complexity Analysis of Static Analyses (DAM), pp. 312–329.
STOC-1999-BlomerS #complexity #independence #on the: On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice (JB, JPS), pp. 711–720.
STOC-1999-ChakrabartiCGL #approximate #bound #complexity #nearest neighbour: A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube (AC, BC, BG, AL), pp. 305–311.
STOC-1999-DinitzMR #complexity #symmetry: Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract) (YD, SM, SR), pp. 265–274.
STOC-1999-FederHKM #complexity #graph #problem: Complexity of Graph Partition Problems (TF, PH, SK, RM), pp. 464–472.
STOC-1999-NayakW #approximate #complexity #quantum #query #statistics: The Quantum Query Complexity of Approximating the Median and Related Statistics (AN, FW), pp. 384–393.
STOC-1999-PanC #complexity #matrix #problem: The Complexity of the Matrix Eigenproblem (VYP, ZQC), pp. 507–516.
STOC-1999-PonzioRV #communication #complexity #pointer: The Communication Complexity of Pointer Chasing: Applications of Entropy and Sampling (SP, JR, SV), pp. 602–611.
STOC-1999-Raz #communication #complexity #exponential #quantum: Exponential Separation of Quantum and Classical Communication Complexity (RR), pp. 358–367.
STOC-1999-Rojas #complexity #geometry #on the: On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract) (JMR), pp. 527–536.
STOC-1999-Servedio #complexity #learning: Computational Sample Complexity and Attribute-Efficient Learning (RAS), pp. 701–710.
DLT-1999-Cassaigne #complexity: Subword complexity and periodicity in two or more dimensions (JC), pp. 14–21.
DLT-1999-KarhumakiP #complexity #on the #order #string: On the complexity of computing the order of repetition of a string (JK, WP), pp. 178–184.
ICALP-1999-JiangLV #complexity: Average-Case Complexity of Shellsort (TJ, ML, PMBV), pp. 453–462.
ICALP-1999-PelegR #complexity #distributed: A Variant of the Arrow Distributed Directory with Low Average Complexity (DP, ER), pp. 615–624.
ICALP-1999-Umans #complexity #on the #problem: On the Complexity and Inapproximability of Shortest Implicant Problems (CU), pp. 687–696.
WIA-1999-CampeanuCSY #complexity #finite: State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.
HCI-CCAD-1999-Caldwell #performance: Team performance in complex systems (BSC), pp. 412–416.
HCI-CCAD-1999-Davies #visualisation: Expertise in a complex domain: supporting creativity through knowledge visualisation and re-description (SPD), pp. 112–116.
HCI-CCAD-1999-GrassHA #incremental #multi #quote: “Search manager”: a dynamic and incremental tool for searching complex objects in multihierarchical structures (MG, PH, UA), pp. 80–84.
HCI-CCAD-1999-Rebstock #case study #complexity #industrial #lessons learnt: Adding complexity to the electronic market model: lessons learned from an oil industry case study (MR), pp. 1147–1151.
HCI-EI-1999-CrosbyC #comprehension #multi #user interface: Investigating User Comprehension of Complex Multi-user Interfaces (MEC, DNC), pp. 856–860.
HCI-EI-1999-Davies99a #generative #memory management #strict: The role of external memory in a complex task: Effects of device and memory restrictions on program generation (SPD), pp. 1268–1272.
HCI-EI-1999-Kitamura #concept #design #interactive #usability: Creativity and Usability Concepts in Designing Human Computer Interaction for Management of Complex Dynamic Systems (MK), pp. 431–435.
HCI-EI-1999-KotaniH: Relationship between Size of Icons and Mouse Operating Force with Complex Actions during Pointing Tasks (KK, KH), pp. 412–415.
HCI-EI-1999-KuzniarzP #analysis #design #object-oriented #towards: Towards Complex Object Oriented Analysis and Design (LK, MP), pp. 1257–1261.
HCI-EI-1999-Stelovsky #architecture #eye tracking #integration #interactive #java #source code #user interface: An Extendible Architecture for the Integration of Eye Tracking and User Interaction Events of Java Programs with Complex User Interfaces (JS), pp. 861–865.
SIGAda-1999-Selic #design pattern #realtime: Architectural patterns for complex real-time systems (abstract of keynote address) (BS), p. 1.
CIKM-1999-JohnsonC #ad hoc: Extending Complex Ad-Hoc OLAP (TJ, DC), pp. 170–179.
KDD-1999-Chatziantoniou #data transformation #emf #sql: The PanQ Tool and EMF SQL for Complex Data Management (DC), pp. 420–424.
MLDM-1999-Sawaragi #data mining #effectiveness #interactive #mining: Reproductive Process-Oriented Data Mining from Interactions between Human and Complex Artifact System (TS), pp. 180–194.
ICSE-1999-KasikKFF #approach #flexibility: A Flexible Approach to Alliances of Complex Applications (DJK, CEK, JLF, KBF), pp. 23–32.
CADE-1999-Sofronie-Stokkermans #complexity #decidability #on the: On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results (VSS), pp. 157–171.
CADE-1999-Wierzbicki #complexity #higher-order: Complexity of the higher order matching (TW), pp. 82–96.
CSL-1999-ArecesBM #complexity #hybrid #logic: A Road-Map on Complexity for Hybrid Logics (CA, PB, MM), pp. 307–321.
CSL-1999-GradelK #complexity #constraints #database: Descriptive Complexity Theory for Constraint Databases (EG, SK), pp. 67–81.
CSL-1999-Grohe #complexity: Descriptive and Parameterized Complexity (MG), pp. 14–31.
CSL-1999-Leivant #complexity: Applicative Control and Computational Complexity (DL), pp. 82–95.
LICS-1999-Friedman #complexity #problem: Some Decision Problems of Enormous Complexity (HF), pp. 2–12.
LICS-1999-GottlobP #complexity #modelling: Working with Arms: Complexity Results on Atomic Representations of Herbrand Models (GG, RP), pp. 306–315.
TLCA-1999-BaillotP #complexity #geometry #interactive: Elementary Complexity and Geometry of Interaction (PB, MP), pp. 25–39.
ASE-1998-MichaelM #automation #generative #source code #testing: Automated Software Test Data Generation for Complex Programs (CCM, GM), pp. 136–146.
DAC-1998-AmonBL #using: Making Complex Timing Relationships Readable: Presburger Formula Simplicication Using Don’t Cares (TA, GB, JL), pp. 586–590.
DAC-1998-AndersonB #scalability: Technology Mapping for Large Complex PLDs (JHA, SDB), pp. 698–703.
DAC-1998-SchaumontVREB #design #programming: A Programming Environment for the Design of Complex High Speed ASICs (PS, SV, LR, ME, IB), pp. 315–320.
PODS-1998-AbiteboulD #complexity #query #using: Complexity of Answering Queries Using Materialized Views (SA, OMD), pp. 254–263.
PODS-1998-GradelGH #complexity #query #reliability: The Complexity of Query Reliability (EG, YG, CH), pp. 227–234.
PODS-1998-KolaitisMT #complexity #on the #problem #query: On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
PODS-1998-VorobyovV #complexity #logic programming #recursion #source code: Complexity of Nonrecursive Logic Programs with Complex Values (SGV, AV), pp. 244–253.
SIGMOD-1998-GrumbachRS #query: The DEDALE System for Complex Spatial Queries (SG, PR, LS), pp. 213–224.
ESOP-1998-ChatterjeeRL #complexity #exception: Complexity of Concrete Type-Inference in the Presence of Exceptions (RC, BGR, WL), pp. 57–74.
CSMR-1998-KazmanB #architecture #complexity: Assessing Architectural Complexity (RK, MB), pp. 104–112.
IWPC-1998-ErdosS #comprehension #maintenance #source code: Partial Comprehension of Complex Programs (enough to perform maintenance) (KE, HMS), pp. 98–105.
STOC-1998-BabaiHK #communication #complexity #cost analysis: The Cost of the Missing Bit: Communication Complexity with Help (LB, TPH, PGK), pp. 673–682.
STOC-1998-BeameKPS #complexity #on the #proving #random #satisfiability: On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
STOC-1998-CrescenziGPPY #complexity #on the: On the Complexity of Protein Folding (Extended Abstract) (PC, DG, CHP, AP, MY), pp. 597–603.
STOC-1998-Grigoriev #bound #complexity #random: Randomized Complexity Lower Bounds (DG), pp. 219–223.
ICALP-1998-AkutsuY #biology #complexity #on the #problem: On the Complexity of Deriving Score Functions from Examples for Problems in Molecular Biology (TA, MY), pp. 832–843.
ICALP-1998-HengleinR #automaton #complexity #constraints #recursion #type system: Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.
ICALP-1998-RaymondTT #algebra #approach #communication #complexity: An Algebraic Approach to Communication Complexity (JFR, PT, DT), pp. 29–40.
ICALP-1998-Touzet #term rewriting: A Complex Example of a Simplifying Rewrite System (HT), pp. 507–517.
ICALP-1998-Walukiewicz #complexity: Difficult Configurations — On the Complexity of LTrL (IW), pp. 140–151.
WIA-1998-Poibeau #automaton: Bi-directional Automata to Extract Complex Phrases from Texts (TP), pp. 110–120.
FM-1998-HutterMRSWBRSS #complexity #formal method #named: VSE: Controlling the Complexity in Formal Software Developments (DH, HM, GR, WS, AW, MB, WR, GS, KS), pp. 351–358.
ICFP-1998-MinamideG #complexity #on the #runtime: On the Runtime Complexity of Type-Directed Unboxing (YM, JG), pp. 1–12.
TAGT-1998-EhrenfeuchtHHR #complexity #graph: Complexity Issues in Switching of Graphs (AE, JH, TH, GR), pp. 59–70.
CIKM-1998-NagD #memory management #query: Memory Allocation Strategies for Complex Decision Support Queries (BN, DJD), pp. 116–123.
ICPR-1998-CheungI #detection #symmetry #using: Symmetry detection using complex moments (KKTC, HHSI), pp. 1473–1475.
ICPR-1998-CretualCB #2d #image #visual notation: Complex object tracking by visual servoing based on 2D image motion (AC, FC, PB), pp. 1251–1254.
ICPR-1998-EglinBE #complexity #using #visual notation: Printed text featuring using the visual criteria of legibility and complexity (VE, SB, HE), pp. 942–944.
ICPR-1998-MagareyD #image #multi #using: Multiresolution stereo image matching using complex wavelets (JM, ARD), pp. 4–7.
ICPR-1998-SardoK #complexity #estimation #using #validation: Model complexity validation for PDF estimation using Gaussian mixtures (LS, JK), pp. 195–197.
ICPR-1998-TerrillonDA #detection #image #invariant: Detection of human faces in complex scene images by use of a skin color model and of invariant Fourier-Mellin moments (JCT, MD, SA), pp. 1350–1355.
KDD-1998-OatesJ #dataset #modelling #scalability: Large Datasets Lead to Overly Complex Models: An Explanation and a Solution (TO, DJ), pp. 294–298.
KR-1998-CervesatoFM #calculus #complexity #model checking #quantifier: The Complexity of Model Checking in Modal Event Calculi with Quantifiers (IC, MF, AM), pp. 368–379.
KR-1998-LangM #complexity #independence #logic: Complexity Results for Independence and Definability in Propositional Logic (JL, PM), pp. 356–367.
ECOOP-1998-GilI #analysis #complexity #object-oriented #source code: The Complexity of Type Analysis of Object Oriented Programs (JYG, AI), pp. 601–634.
TOOLS-USA-1998-Mellor98a #behaviour #how #modelling #question: Modeling Complex Behavior Simply or How Much is Too Much? (SJM), p. 444.
TOOLS-USA-1998-SoulieMCC #framework #object-oriented #simulation: GEAMAS V2.0: An Object Oriented Platform for Complex Systems Simulations (JCS, PM, SC, RC), p. 230–?.
ALP-PLILP-1998-PontelliRG #complexity #object-oriented: The Complexity of Late-Binding in Dynamic Object-Oriented Languages (EP, DR, GG), pp. 213–229.
REFSQ-1998-Deifel #off the shelf #requirements: Requirements Engineering for Complex COTS (BD), pp. 63–67.
SAC-1998-Marchiori #analysis: Light analysis of complex systems (MM), pp. 18–22.
ICSE-1998-CugolaNF #distributed #framework: Exploiting an Event-Based Infrastructure to Develop Complex Distributed Systems (GC, EDN, AF), pp. 261–270.
ICSE-1998-HerbslebG #case study #complexity #concept #metric: Conceptual Simplicity Meets Organizational Complexity: Case Study of a Corporate Metrics Program (JDH, REG), pp. 271–280.
ICSE-1998-TarrC #consistency: Consistency Management for Complex Applications (PLT, LAC), pp. 230–239.
LCTES-1998-Selic #modelling #realtime #uml #using: Using UML for Modeling Complex Real-Time Systems (BS), pp. 250–260.
CSL-1998-BonfanteCMT #complexity #polynomial #term rewriting: Complexity Classes and Rewrite Systems with Polynomial Interpretation (GB, AC, JYM, HT), pp. 372–384.
CSL-1998-Pezzoli #complexity #finite #game studies: Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures (EP), pp. 159–170.
CSL-1998-Pichler #complexity #on the: On the Complexity of H-Subsumption (RP), pp. 355–371.
CSL-1998-RicheM #complexity #decidability: Belnap, Urquhart and Relevant Decidability & Complexity. “Das ist nicht Mathematik, das ist Theologie.” (JR, RKM), pp. 224–240.
CSL-1998-Schwentick #bound #complexity #linear: Descriptive Complexity, Lower Bounds and Linear Time (TS), pp. 9–28.
LICS-1998-Vardi #branch #linear #perspective: Linear vs. Branching Time: A Complexity-Theoretic Perspective (MYV), pp. 394–405.
DAC-1997-YimHPCYOPK #design #verification: A C-Based RTL Design Verification Methodology for Complex Microprocessor (JSY, YHH, CJP, HC, WSY, HSO, ICP, CMK), pp. 83–88.
EDTC-1997-StopjakovaM #monitoring #testing: CCII+ current conveyor based BIC monitor for IDDQ testing of complex CMOS circuits (VS, HARM), pp. 266–270.
EDTC-1997-WalkerG #simulation: VHDL extensions for complex transmission line simulation (PW, SG), pp. 368–372.
HT-1997-HusemannPKKH #adaptation #navigation: An User Adaptive Navigation Metaphor to Connect and Rate the Coherence of Terms and Complex Objects (HH, JP, CK, HDK, PH), pp. 214–215.
HT-1997-Kolb #complexity #hypermedia #self: Scholarly Hypertext: Self-Represented Complexity (DK), pp. 29–37.
ICDAR-1997-DoriW #algorithm #segmentation: Arc Segmentation from Complex Line Environments: A Vector-Based Stepwise Recovery Algorithm (DD, LW), pp. 76–80.
ICDAR-1997-WolfN #locality: Form--Based Localization of the Destination Address Block on Complex Envelopes (MW, HN), p. 908–?.
PODS-1997-LevyS #query: Deciding Containment for Queries with Complex Objects (AYL, DS), pp. 20–31.
PODS-1997-PapadimitriouY #complexity #database #on the #query: On the Complexity of Database Queries (CHP, MY), pp. 12–19.
PODS-1997-ScheufeleM #complexity #generative #on the: On the Complexity of Generating Optimal Plans with Cross Products (WS, GM), pp. 238–248.
VLDB-1997-PellenkoftLK #complexity: The Complexity of Transformation-Based Join Enumeration (AP, CAGL, MLK), pp. 306–315.
VLDB-1997-WhiteheadSM #information retrieval #using: GTE SuperPages: Using IR Techniques for Searching Complex Objects (SDW, HS, MM), pp. 553–557.
ICSM-1997-Krikhaar #approach #architecture: Reverse Architecting Approach for Complex Systems (RLK), pp. 4–11.
STOC-1997-AgrawalAIPR #complexity #reduction: Reducing the Complexity of Reductions (MA, EA, RI, TP, SR), pp. 730–738.
STOC-1997-BelingV #combinator #complexity: Combinatorial Complexity of the Central Curve (PAB, SV), pp. 250–255.
STOC-1997-Dietzfelbinger #communication #complexity #problem: The Linear-Array Problem in Communication Complexity Resolved (MD), pp. 373–382.
STOC-1997-Reif #approximate #constant #evaluation #polynomial: Approximate Complex Polynomial Evaluation in Near Constant Work Per Point (JHR), pp. 30–39.
STOC-1997-Vardy #algorithm #complexity #distance #problem: Algorithmic Complexity in Coding Theory and the Minimum Distance Problem (AV), pp. 92–109.
DLT-1997-IkedaA #complexity #on the: On the Complexity of Languages Definable by Hereditary Elementary Formal Systems (DI, HA), pp. 223–235.
DLT-1997-Moshkov #complexity #nondeterminism #recognition #regular expression #word: Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.
ICALP-1997-Ambainis #bound #communication #complexity #information retrieval: Upper Bound on Communication Complexity of Private Information Retrieval (AA), pp. 401–407.
FME-1997-DevauchelleLV #named #specification: PICGAL: Practical Use of Formal Specification to Develop a Complex Critical System (LD, PGL, HV), pp. 221–236.
ICFP-1997-HeintzeM #analysis #complexity #on the: On the Complexity of Set-Based Analysis (NH, DAM), pp. 150–163.
HCI-CC-1997-Averboukh #design: Coherent Ergodynamical Design and Technology Transfer of Complex Dynamic Systems (EAA), pp. 859–862.
HCI-CC-1997-BayehMSCCA #human-computer: Methodology for Studying Complex Ergonomic Interventions for HCI Work (ADB, FBPM, MJS, PC, FTC, PA), pp. 489–492.
HCI-CC-1997-KappC #design #interface: Organizational Culture and Ideology in the Design of Complex Computer System Interfaces (EAK, BSC), pp. 125–128.
HCI-CC-1997-SavidisS97a #complexity #declarative #framework #specification: Agent Classes for Managing Dialogue Control Specification Complexity: A Declarative Language Framework (AS, CS), pp. 461–464.
HCI-CC-1997-WatersonOC #development: Further Development of a New Method for Task Allocation in Complex Systems (PEW, MTO, CWC), pp. 257–260.
HCI-SEC-1997-GargRK #fault #modelling: Modeling the Sources and Consequences of Errors and Delays in Complex Systems (CG, VR, JWK), pp. 67–70.
HCI-SEC-1997-Hollnagel97a #complexity #design: Designing for Complexity (EH), pp. 217–220.
HCI-SEC-1997-LaugheryP #case study #performance #predict: Predicting Human Performance in Complex Systems-A Method and Case Study (KRLJ, BMP), pp. 75–78.
HCI-SEC-1997-LucasMP #interface #network #re-engineering: Re-Engineering a Complex Network Interface (ML, JFM, CP), pp. 771–774.
HCI-SEC-1997-SawaY #architecture #modelling #simulation: New Modeling/Analyzing Architecture and Simulation Mechanism for Complex Structure (TS, MY), pp. 363–366.
HCI-SEC-1997-Tarpin-BernardD #design pattern #interactive #named #question: AMF: A New Design Pattern for Complex Interactive Software? (FTB, BTD), pp. 351–354.
TRI-Ada-1997-HendrixCBM #ada #complexity #visualisation: Visualization of Control Structure and Complexity in Ada 95 (TDH, JHCI, LAB, KSM), pp. 135–139.
CAiSE-1997-OussalahU #version control: Complex Object Versioning (CO, CU), pp. 259–272.
ACIR-1997-RollekeF: Retrieving Complex Objects with HySpirit (TR, NF).
CIKM-1997-JonesR: View Materialization Techniques for Complex Hierarchical Objects (MCJ, EAR), pp. 222–229.
ICML-1997-OatesJ #complexity #set: The Effects of Training Set Size on Decision Tree Complexity (TO, DJ), pp. 254–262.
KDD-1997-Ketterlin #clustering #sequence: Clustering Sequences of Complex Objects (AK), pp. 215–218.
POPL-1997-Deutsch #analysis #complexity #on the: On the Complexity of Escape Analysis (AD), pp. 358–371.
RE-1997-ZaveJ #complexity #requirements: Requirements for Telecommunications Services: An Attack on Complexity (PZ, MJ), pp. 106–117.
CSL-1997-Pezzoli #complexity #on the: On the Computational Complexity of Type 2 Functionals (EP), pp. 373–388.
ICLP-1997-CervesatoFM #calculus #complexity #model checking: The Complexity of Model Checking in Modal Event Calculi (IC, MF, AM), p. 419.
ILPS-1997-KingSB #analysis #bound #logic programming #source code: Lower-bound Time-complexity Analysis of Logic Programs (AK, KS, FB), pp. 261–275.
LICS-1997-HengleinR #complexity #type system: The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.
LICS-1997-Kozen #algebra #complexity #on the #reasoning: On the Complexity of Reasoning in Kleene Algebra (DK), pp. 195–202.
LICS-1997-PacholskiST #complexity #logic: Complexity of Two-Variable Logic with Counting (LP, WS, LT), pp. 318–327.
LICS-1997-ZhangR #complexity #reasoning: Complexity of Power Default Reasoning (GQZ, WCR), pp. 328–339.
DAC-1996-KudvaGJN #multi #network #synthesis: Synthesis for Hazard-free Customized CMOS Complex-Gate Networks Under Multiple-Input Changes (PK, GG, HMJ, SMN), pp. 77–82.
KBSE-1996-Benner #automation #complexity #coordination #development: Addressing Complexity, Coordination, and Automation in Software Development with the KBSA/ADM (KB), p. 13.
HT-1996-JoyceKMSU #complexity #design #generative #problem #visual notation #visualisation #web: Visual Metaphor and the Problem of Complexity in the Design of Web Sites: Techniques for Generating, Recognizing and Visualizing Structure (MJ, RK, SM, BS, JMU), p. 257.
PODS-1996-BettiniWJ #data mining #mining #multi #testing: Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining (CB, XSW, SJ), pp. 68–78.
SIGMOD-1996-PiatkoYLS #documentation #named: Thinksheet: A Tool for Tailoring Complex Documents (PP, RY, DIL, DS), p. 546.
ICSM-1996-TakahashiN #complexity #fault #interface: The effect of interface complexity on program error density (RT, YN), pp. 77–86.
STOC-1996-AfekMO #algorithm #complexity #convergence: Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract) (YA, YM, ZO), pp. 89–98.
STOC-1996-AllenderBO #complexity #equation #linear #matrix #rank: The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract) (EA, RB, MO), pp. 161–167.
STOC-1996-AlonMS #approximate #complexity: The Space Complexity of Approximating the Frequency Moments (NA, YM, MS), pp. 20–29.
STOC-1996-Beaver #complexity #correlation #pseudo: Correlated Pseudorandomness and the Complexity of Private Computations (DB), pp. 479–488.
STOC-1996-ChaudhuriR #complexity #strict: Deterministic Restrictions in Circuit Complexity (SC, JR), pp. 30–36.
STOC-1996-DeyG #algorithm: Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version) (TKD, SG), pp. 398–407.
STOC-1996-KushilevitzLO #communication #complexity: The Linear-Array Conjecture in Communication Complexity is False (EK, NL, RO), pp. 1–10.
ICALP-1996-PatersonP #complexity #on the #string: On the Complexity of String Folding (MP, TMP), pp. 658–669.
ICALP-1996-ShuklaHRS #complexity #finite #on the #problem #process #relational: On the Complexity of Relational Problems for Finite State Processes (Extended Abstract) (SKS, HBHI, DJR, RES), pp. 466–477.
ICFP-1996-Ghelli #complexity #kernel #type checking #type system: Complexity of Kernel Fun Subtype Checking (GG), pp. 134–145.
CSCW-1996-Wyner #coordination #design #distributed: The Language of Coordination: A Method for the Distributed Design of Complex Organizations (doctoral colloquium) (GMW), p. 446.
CIKM-1996-OussalahP #constraints: Integrating Constraints in Complex Objects (CO, VP), pp. 189–196.
CIKM-1996-ShinKC #named #performance #query: S-signature: A New Scheme for Efficient Query Processing of Complex Objects in OODB (HS, KK, JWC), pp. 207–214.
ICPR-1996-AmaraBCWML #estimation #parametricity #recursion #segmentation: A recursive estimation of parameters of straight lines and circles: application to the segmentation of the Rey’s Complex Figure (MA, DdB, PC, PW, CM, YL), pp. 467–471.
ICPR-1996-CuiW #recognition #segmentation: View-based hand segmentation and hand-sequence recognition with complex backgrounds (YC, J(W), pp. 617–621.
ICPR-1996-HoK #classification #complexity: Building projectable classifiers of arbitrary complexity (TKH, EMK), pp. 880–885.
ICPR-1996-KindratenkoE #classification #fourier #using: Classification of irregularly shaped micro-objects using complex Fourier descriptors (VVK, PJMVE), pp. 285–289.
ICPR-1996-KrzyzakL #classification #complexity #convergence #network #parametricity: Radial basis function networks and nonparametric classification: complexity regularization and rates of convergence (AK, TL), pp. 650–653.
ICPR-1996-LeonardisB #adaptation #complexity #network #optimisation: Complexity optimization of adaptive RBF networks (TL, HB), pp. 654–658.
ICPR-1996-PeiH96a #algorithm #complexity #detection #symmetry: A low complexity algorithm for detecting rotational symmetry based on the Hough transform technique (SCP, JHH), pp. 492–496.
ICPR-1996-SardoK #complexity #correlation #estimation: Minimum complexity PDF estimation for correlated data (LS, JK), pp. 750–754.
ICPR-1996-WorringW #analysis #using: Analysis of complex motion patterns using region-based curve analysis (MW, AdW), pp. 388–392.
KR-1996-BaaderS #logic #strict: Number Restrictions on Complex Roles in Description Logics: A Preliminary Report (FB, US), pp. 328–339.
KR-1996-Gottlob #complexity #power of: Complexity and Expressive Power of KR Formalisms (Invited Talk Abstract) (GG), pp. 647–649.
KR-1996-Kelley #calculus #case study #modelling #problem #using: Modeling Complex Systems in the Situation Calculus: A Case Study Using the Dagstuhl Steam Boiler Problem (TGK), pp. 26–37.
SEKE-1996-Zadrozny #complexity #natural language: Natural Language Processing: Structure and Complexity (WZ), pp. 595–602.
SIGIR-1996-RollekeF #logic #retrieval #using: Retrieval of Complex Objects Using a Four-Valued Logic (TR, NF), pp. 206–214.
POPL-1996-Asperti #complexity #on the: On the Complexity of β-Reduction (AA), pp. 110–118.
SAC-1996-HasemiPAHP #approach #classification #search-based: A rough-genetic approach for classification of complex data (RH, BAP, RBA, WGH, MGP), pp. 282–288.
JICSLP-1996-Chau #definite clause grammar #specification: Specification of Complex Systems with Definite Clause Grammar (Poster Abstract) (HLC), p. 544.
LICS-1996-BasinG #analysis #complexity #order: Complexity Analysis Based on Ordered Resolution (DAB, HG), pp. 456–465.
LICS-1996-HirstH #complexity #recursion: More About Recursive Structures: Descriptive Complexity and Zero-One Laws (TH, DH), pp. 334–347.
LICS-1996-MarekNR #abduction #complexity #on the: On the Complexity of Abduction (VWM, AN, JBR), pp. 513–522.
DAC-1995-StollonP #behaviour #complexity #metric #modelling: Measures of Syntactic Complexity for Modeling Behavioral VHDL (NSS, JDP), pp. 684–689.
ICDAR-v1-1995-ZhongKJ #image: Locating text in complex color images (YZ, KK, AKJ), pp. 146–149.
ICDAR-v2-1995-AntonacopoulosR #classification #representation #using: Representation and classification of complex-shaped printed regions using white tiles (AA, RTR), pp. 1132–1135.
ICDAR-v2-1995-DeforgesB #detection #documentation #image #multi #performance #robust #segmentation: Segmentation of Complex Documents Multilevel Images: A Robust and Fast Text Bodies-Headers Detection and Extraction Scheme 770 (OD, DB), pp. 770–773.
ICDAR-v2-1995-FutrelleN #analysis #constraints #diagrams #parsing #performance #using: Efficient analysis of complex diagrams using constraint-based parsing (RPF, NN), pp. 782–790.
ICDAR-v2-1995-Randriamasy #benchmark #image #metric: A set-based benchmarking method for address bloc location on arbitrarily complex grey level images (SR), pp. 619–622.
PODS-1995-Vardi #bound #complexity #on the #query: On the Complexity of Bounded-Variable Queries (MYV), pp. 266–276.
SIGMOD-1995-BhargavaGI #query: Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates (GB, PG, BRI), pp. 304–315.
ICSM-1995-Schneberger #complexity #component #distributed #maintenance: Software maintenance in distributed computer environments: system complexity versus component simplicity (SLS), pp. 304–317.
STOC-1995-BealsNT #complexity: More on the complexity of negation-limited circuits (RB, TN, KT), pp. 585–595.
STOC-1995-BeameCEIP #complexity #problem: The relative complexity of NP search problems (PB, SAC, JE, RI, TP), pp. 303–314.
STOC-1995-GradelM #complexity: Descriptive complexity theory over the real numbers (EG, KM), pp. 315–324.
STOC-1995-KremerNR #communication #complexity #on the #random: On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
STOC-1995-MiltersenNSW #communication #complexity #data type #on the #symmetry: On data structures and asymmetric communication complexity (PBM, NN, SS, AW), pp. 103–111.
STOC-1995-NisanW #complexity #memory management #on the: On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern (NN, AW), pp. 723–732.
STOC-1995-Pan #algorithm #approximate #parallel #polynomial: Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros (VYP), pp. 741–750.
DLT-1995-Cai #complexity #component: The Computational Complexity of PCGS with Regular Components (LC), pp. 209–219.
DLT-1995-Cassaigne #complexity #linear #sequence: Special Factors of Sequences with Linear Subword Complexity (JC), pp. 25–34.
DLT-1995-Georgescu #complexity #context-free grammar #metric #orthogonal: The Orthogonality of Some Complexity Measures of Context-Free Languages (GG), pp. 73–78.
DLT-1995-Hromkovic #communication #complexity #generative #on the: On the Communication Complexity of Distributive Language Generation (JH), pp. 237–246.
DLT-1995-Lepisto #complexity #infinity #on the #word: On the Computational Complexity of Infinite Words (AL), pp. 350–359.
ICALP-1995-Balcazar #complexity #graph: The Complexity of Searching Succinctly Represented Graphs (JLB), pp. 208–219.
CHI-1995-LokugeI #interactive #named #visualisation: GeoSpace: An Interactive Visualization System for Exploring Complex Information Spaces (IL, SI), pp. 409–414.
CHI-1995-MastaglioW #development #scalability: User-Centered Development of a Large-Scale Complex Networked Virtual Environment (TWM, JW), pp. 546–552.
CHI-1995-MukherjeaFH #hypermedia #multi #network #visualisation: Visualizing Complex Hypermedia Networks through Multiple Hierarchical Views (SM, JDF, SEH), pp. 331–337.
CHI-1995-WhittakerS #coordination: Back to the Future: Pen and Paper Technology Supports Complex Group Coordination (SW, HS), pp. 495–502.
CAiSE-1995-ViehstaedtM #formal method #representation #visual notation: Graphical Representation and Manipulation of Complex Structures Based on a Formal Model (GV, MM), pp. 243–254.
ICML-1995-Niyogi #complexity #learning: Free to Choose: Investigating the Sample Complexity of Active Learning of Real Valued Functions (PN), pp. 405–412.
ICML-1995-Schmidhuber #complexity: Discovering Solutions with Low Kolmogorov Complexity and High Generalization Capability (JS), pp. 488–496.
KDD-1995-CortesDHV #capacity #complexity #predict: Capacity and Complexity Control in Predicting the Spread Between Borrowing and Lending Interest Rates (CC, HD, DH, VV), pp. 51–56.
SEKE-1995-ChauC #semantics #syntax #visual notation: Visual Language Syntax and Semantics for Complex Reactive System (HLC, KFC), pp. 252–259.
SEKE-1995-Miur #optimisation #query #visual notation: Optimizing Complex Objects Queries in A Visual Data Manipulation Language (TM), pp. 153–157.
LOPSTR-1995-Aarts #complexity #source code: Complexity of Horn Programs (EA), pp. 76–90.
SAC-1995-Spector #development #problem #using: Using system dynamics to model courseware development: the project dynamics of complex problem-solving (JMS), pp. 32–35.
ICSE-1995-ChambersDG #dependence #framework: A Framework for Selective Recompilation in the Presence of Complex Intermodule Dependencies (CC, JD, DG), pp. 221–230.
PPoPP-1995-GotwalsSG #data type #distributed #library: pC++/streams: a Library for I/O on Complex Distributed Data Structures (JG, SS, DG), pp. 11–18.
LICS-1995-Kanovich #complexity #linear #logic: The Complexity of Neutrals in Linear Logic (MIK), pp. 486–495.
LICS-1995-MarekNR #complexity #logic #reasoning: Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning (VWM, AN, JBR), pp. 178–185.
LICS-1995-Seth #complexity #fixpoint #logic #question: When Do Fixed Point Logics Capture Complexity Classes? (AS), pp. 353–363.
LICS-1995-Vardi #complexity #composition #model checking #on the: On the Complexity of Modular Model Checking (MYV), pp. 101–111.
EDAC-1994-BurgunDGPS #complexity #logic #multi #synthesis: Multilevel Logic Synthesis of Very High Complexity Circuits (LB, ND, AG, EP, CS), p. 669.
EDAC-1994-GreinerLWW #complexity #design #library: Design of a High Complexity Superscalar Microprocessor with the Portable IDPS ASIC Library (AG, LL, FW, LW), pp. 9–13.
EDAC-1994-VanbekbergenYLM #graph #interface #specification: A Generalized Signal Transition Graph Model for Specification of Complex Interfaces (PV, CYC, BL, HDM), pp. 378–384.
PODS-1994-ChaudhuriV #complexity #datalog #equivalence #on the #recursion #source code: On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.
PODS-1994-ColbyRSG #query: A Query Language for List-Based Complex Objects (LSC, ELR, LVS, DVG), pp. 179–189.
PODS-1994-PatnaikI #complexity #named #parallel: Dyn-FO: A Parallel, Dynamic Complexity Class (SP, NI), pp. 210–221.
PODS-1994-SuciuP #algebra #algorithm #exponential #set #transitive: Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure (DS, JP), pp. 201–209.
SIGMOD-1994-McIverK #adaptation #clustering #online #self: Self-Adaptive, On-Line Reclustering of Complex Object Data (WJMJ, RK), pp. 407–418.
VLDB-1994-BrownMCL #automation #performance #towards: Towards Automated Performance Tuning for Complex Workloads (KPB, MM, MJC, ML), pp. 72–84.
ICSM-1994-ChenS #complexity #metric #rule-based: Complexity Metrics for Rule-Based Expert Systems (ZC, CYS), pp. 382–391.
ICSM-1994-LanningK #canonical #complexity #fault #modelling #process: Canonical Modeling of Software Complexity and Fault Correction Activity (DLL, TMK), pp. 374–381.
ICSM-1994-RegelsonA #debugging #legacy: Debugging Practices for Complex Legacy Software Systems (ER, AA), pp. 137–143.
PLDI-1994-FisherG #reduction: Parallelizing Complex Scans and Reductions (ALF, AMG), pp. 135–146.
STOC-1994-AnderssonHHP #array #complexity #string: The complexity of searching a sorted array of strings (AA, TH, JH, OP), pp. 317–325.
STOC-1994-GoldreichOP #complexity: Computational complexity and knowledge complexity (extended abstract) (OG, RO, EP), pp. 534–543.
STOC-1994-JakobyRS #complexity: Circuit complexity: from the worst case to the average case (AJ, RR, CS), pp. 58–67.
STOC-1994-JiangLW #approximate #complexity #sequence: Aligning sequences via an evolutionary tree: complexity and approximation (TJ, ELL, LW), pp. 760–769.
STOC-1994-Kurshan #complexity #verification: The complexity of verification (RPK), pp. 365–371.
STOC-1994-LiptonY #complexity #game studies #scalability: Simple strategies for large zero-sum games with applications to complexity theory (RJL, NEY), pp. 734–740.
STOC-1994-MaG #complexity #permutation: The computational complexity of recognizing permutation functions (KM, JvzG), pp. 392–401.
STOC-1994-MuthukrishnanP #algorithm #complexity #standard #string: Non-standard stringology: algorithms and complexity (SM, KVP), pp. 770–779.
STOC-1994-PapadimitriouY #bound #complexity #on the: On complexity as bounded rationality (extended abstract) (CHP, MY), pp. 726–733.
STOC-1994-TanakaN #complexity #network #on the: On the complexity of negation-limited Boolean networks (KT, TN), pp. 38–47.
STOC-1994-Yao #complexity: Decision tree complexity and Betti numbers (ACCY), pp. 615–624.
ICALP-1994-GlobermanH #automaton #complexity #logic #multi: Complexity Results for Multi-Pebble Automata and their Logics (NG, DH), pp. 73–82.
ICALP-1994-GradelG #complexity: Tailoring Recursing for Complexity (EG, YG), pp. 118–129.
ICALP-1994-JakobyRSW #complexity #parallel #problem: The Average Case Complexity of the Parallel Prefix Problem (AJ, RR, CS, SW), pp. 593–604.
ICALP-1994-Pudlak #bound #communication #complexity #game studies: Unexpected Upper Bounds on the Complexity of Some Communication Games (PP), pp. 1–10.
CSCW-1994-StarR #collaboration #design #framework #problem #scalability #towards: Steps Towards an Ecology of Infrastructure: Complex Problems in Design and Access for Large-Scale Collaborative Systems (SLS, KR), pp. 253–264.
CIKM-1994-Al-AnziS #behaviour #concurrent #modelling #towards: Modeling Behavior, A Step Towards Defining Functionally Correct Views of Complex Objects in Concurrent Engineering (FSAA, DLS), pp. 1–9.
ICML-1994-Valdes-PerezP #behaviour #heuristic: A Powerful Heuristic for the Discovery of Complex Patterned Behaviour (REVP, AP), pp. 326–334.
KR-1994-FriedmanH94a #complexity #logic #on the: On the Complexity of Conditional Logics (NF, JYH), pp. 202–213.
KR-1994-Koubarakis #complexity #constraints #first-order: Complexity Results for First-Order Theories of Temporal Constraints (MK), pp. 379–390.
SEKE-1994-Tovar #complexity #information management #metric: Applicability of McCabe’s complexity metric to knowledge engineering products (ET), pp. 508–515.
OOPSLA-1994-Kristensen #abstraction #modelling #object-oriented: Complex Associations: Abstractions in Object-Oriented Modeling (BBK), pp. 272–286.
TOOLS-EUROPE-1994-SappinoVBGMC #lifecycle #object-oriented: Experiencing Full Object-Oriented Lifecycle in a Complex Financial Domain (SS, BV, EB, VG, DM, GC), pp. 217–224.
ICRE-1994-Alford #complexity #requirements #using: Attacking requirements complexity using a separation of concerns (MWA), pp. 2–5.
FSE-1994-BatoryTS #compilation #data type #re-engineering #scalability #using: Reengineering a Complex Application Using a Scalable Data Structure Compiler (DSB, JT, MS), pp. 111–120.
CADE-1994-HermannK #complexity #equation #problem: The Complexity of Counting Problems in Equational Matching (MH, PGK), pp. 560–574.
ICLP-1994-HolsheimerBA #database #interface: A Database Interface for Complex Objects (MH, RAdB, HAK), pp. 437–455.
ILPS-1994-Gottlob #complexity #logic programming #power of: Complexity and Expressive Power of Disjunctive Logic Programming (GG), pp. 23–42.
LICS-1994-Hemaspaandra #complexity #logic: Complexity Transfer for Modal Logic (Extended Abstract) (EH), pp. 164–173.
LICS-1994-ZhangSS #calculus #complexity #model checking #on the #parallel #μ-calculus: On the Parallel Complexity of Model Checking in the Modal μ-Calculus (SZ, OS, SAS), pp. 154–163.
DAC-1993-Duvall #design #statistics: Practical Statistical Design of Complex Integrated Circuit Products (SGD), pp. 561–565.
DAC-1993-EvekingH #optimisation: Optimization and Resynthesis of Complex Data-Paths (HE, SH), pp. 637–641.
ICDAR-1993-CaesarGM93a #adaptation #classification #scalability #set: Utilization of large disordered sample sets for classifier adaptation in complex domains (TC, JMG, EM), pp. 790–793.
ICDAR-1993-InoharaKSS #complexity #database #retrieval #using: Retrieval method of textile pictures database using a complexity scale (TI, KK, HS, SS), pp. 699–702.
ICDAR-1993-Ishitani #complexity #detection #documentation: Document skew detection based on local region complexity (YI), pp. 49–52.
PODS-1993-EiterG #aspect-oriented #complexity #database #semantics: Complexity Aspects of Various Semantics for Disjunctive Databases (TE, GG), pp. 158–167.
SIGMOD-1993-PolyachenkoA #development #distributed #parallel: Instrumental Complex of Parallel Software System Development and Operating Environment Support for Distributed Processing within Multitransputer Systems, TRANSSOFT (BEP, FIA), pp. 548–549.
STOC-1993-BernsteinV #complexity #quantum: Quantum complexity theory (EB, UVV), pp. 11–20.
STOC-1993-ChouK #2d #complexity: Some complexity issues on the simply connected regions of the two-dimensional plane (AWC, KIK), pp. 1–10.
STOC-1993-Maass #bound #complexity #learning: Bounds for the computational power and learning complexity of analog neural nets (WM), pp. 335–344.
DLT-1993-DammHLR #complexity: Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.
ICALP-1993-Ablayev #bound #communication #complexity #probability: Lower Bounds for One-way Probabilistic Communication Complexity (FMA), pp. 241–252.
ICALP-1993-Hemachandra #complexity #fault tolerance: Fault-Tolerance and Complexity (Extended Abstract) (LAH), pp. 189–202.
ICALP-1993-MaratheHR #approximate #complexity #problem #specification: The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract) (MVM, HBHI, SSR), pp. 76–87.
ICALP-1993-ReifT #complexity #simulation: The Complexity of N-body Simulation (JHR, SRT), pp. 162–176.
HCI-ACS-1993-LawtonML #complexity #design #process: Managing Complexity: Display Design in Process Control (GLL, DLM, PLL), pp. 139–144.
HCI-ACS-1993-OBrienFM #automation #monitoring: The Effect of Automated Intelligent Advisors on Human Decision Making in Monitoring Complex Mechanical Systems (KO, EMF, FM), pp. 185–190.
HCI-ACS-1993-SpeelmanBK #modelling: The Rle of Mental Models in Complex Dynamic Environments (CPS, DBJ, KK), pp. 593–598.
HCI-ACS-1993-VankovGRV #complexity: Operational Complexity of Controlling Space Vehicles (AV, YG, AR, AV), pp. 219–224.
HCI-ACS-1993-VekkerAY #complexity #on the: On Psychophysiology of Cognitive Complexity (LV, JAA, YY), pp. 605–610.
HCI-ACS-1993-VendaH #analysis #complexity: Qualitative and Quantitative Analysis of Human Decision-Making Complexity (VFV, HWH), pp. 636–641.
HCI-ACS-1993-YufikS #complexity #framework #human-computer #interface: A Framework for Measuring Cognitive Complexity of the Human-Machine Interface (YMY, TBS), pp. 587–592.
HCI-SHI-1993-GlazkovRVV #complexity: Control of Cosmonauts Training to Overcome Operational Complexity (YG, AR, AV, AV), pp. 772–777.
HCI-SHI-1993-RizzoPCB #learning: Control of Complex System by Situated Knowledge: The Role of Implicit Learning (AR, OP, CC, SB), pp. 855–860.
CIKM-1993-Saraiya #query: Projection-Propagation in Complex-Object Query Languages (YPS), pp. 413–422.
SEKE-1993-Cheng #complexity #metric #rule-based: A New Complexity Metric for OPS5 Rule-Based Systems (AMKC), pp. 244–247.
TOOLS-USA-1993-AdarFKC #comprehension: The Objectworks Browsing Model — Understanding Complex Software (MA, RF, WPK, TC), pp. 123–132.
TOOLS-USA-1993-Firesmith93a #development #named #object-oriented #realtime #scalability: ADM4: an Object-Oriented Development Method for Large, Complex Real Time Systems (DF), p. 558.
PLILP-1993-Dikovsky #complexity #prolog: Abstract Complexity of Prolog Based on WAM (AJD), pp. 365–377.
POPL-1993-DhamdhereK #analysis #bidirectional #complexity #data flow: Complexity of Bidirectional Data Flow Analysis (DMD, UPK), pp. 397–408.
POPL-1993-Leivant #complexity #functional #source code: Stratified Functional Programs and Computational Complexity (DL), pp. 325–333.
SAC-1993-Liu #approach #complexity: To Approach an Intelligent System in Coping with an Aspect of Complexity of Water Management (YL), pp. 460–468.
SAC-1993-ONeal #complexity #empirical #metric: An Empirical Study of Three Common Software Complexity Measures (MBO), pp. 203–207.
CSL-1993-AikenKVW #complexity #constraints #set: The Complexity of Set Constraints (AA, DK, MYV, ELW), pp. 1–17.
ILPS-1993-EiterG #complexity #logic #logic programming: Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics (TE, GG), pp. 266–278.
PODS-1992-Bonner #complexity #reuse: The Complexity of Reusing and Modifying Rulebases (AJB), pp. 316–330.
PODS-1992-EiterG #complexity #knowledge base #on the: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals (TE, GG), pp. 261–273.
PODS-1992-Meyden #complexity #order #query: The Complexity of Querying Indefinite Data about Linearly Ordered Domains (RvdM), pp. 331–345.
SIGMOD-1992-KaferS: Realizing a Temporal Complex-Object Data Model (WK, HS), pp. 266–275.
STOC-1992-BabaiBT #complexity #symmetry: Symmetry and Complexity (LB, RB, PTN), pp. 438–449.
STOC-1992-BeameL #communication #complexity #nondeterminism #random: Randomized versus Nondeterministic Communication Complexity (PB, JL), pp. 188–199.
STOC-1992-DahlhausJPSY #complexity #multi: The Complexity of Multiway Cuts (Extended Abstract) (ED, DSJ, CHP, PDS, MY), pp. 241–251.
STOC-1992-FranklinY #communication #complexity: Communication Complexity of Secure Computation (Extended Abstract) (MKF, MY), pp. 699–710.
STOC-1992-Kelsen #complexity #independence #on the #parallel #set: On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph (PK), pp. 339–350.
STOC-1992-SimonS #complexity #on the #ram #set: On the Complexity of RAM with Various Operation Sets (JS, MS), pp. 624–631.
ICALP-1992-ChazelleR #bound #complexity #pointer: Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine (BC, BR), pp. 439–449.
ICALP-1992-Debray #analysis #complexity #data flow #logic programming #on the #source code: On the Complexity of Dataflow Analysis of Logic Programs (SKD), pp. 509–520.
ICALP-1992-LiV #complexity: Philosophical Issues in Kolmogorov Complexity (ML, PMBV), pp. 1–15.
ICALP-1992-Straubing #complexity #first-order #power of: Circuit Complexity and the Expressive Power of Generalized First-Order Formulas (HS), pp. 16–27.
CHI-1992-WhartonBJF #case study #experience #recommendation #user interface: Applying cognitive walkthroughs to more complex user interfaces: experiences, issues, and recommendations (CW, JB, RJ, MF), pp. 381–388.
CAiSE-1992-HofstedePW #modelling: Data Modelling in Complex Application Domains (AHMtH, HAP, TPvdW), pp. 364–377.
KR-1992-NiemelaR #complexity #on the #reasoning: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning (IN, JR), pp. 627–638.
TOOLS-EUROPE-1992-BreuningA #set #user interface #visual notation: Hierarchic Views — a Construction Set for Complex Graphical User Interfaces (RB, WA), pp. 325–332.
POPL-1992-JoungS #complexity #interactive #multi: A Comprehensive Study of the Complexity of Multiparty Interaction (YJJ, SAS), pp. 142–153.
CC-1992-ErtlK #pipes and filters #scheduling: Instruction Scheduling for Complex Pipelines (MAE, AK), pp. 207–218.
CADE-1992-CichonL #algorithm #complexity #polynomial: Polynomial Interpretations and the Complexity of Algorithms (AC, PL), pp. 139–147.
LICS-1992-KapurN #complexity #set: Double-exponential Complexity of Computing a Complete Set of AC-Unifiers (DK, PN), pp. 11–21.
KBSE-1991-IpCH #knowledge-based #requirements: Complex Objects in Knowledge-Based Requirements Engineering (SI, LCYC, TH), pp. 8–15.
PODS-1991-GrumbachV #database #query: Tractable Query Languages for Complex Object Databases (SG, VV), pp. 315–327.
PODS-1991-Roy #clustering #complexity #independence #query #relational #semantics: Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning (SR), pp. 259–267.
SIGMOD-1991-ChengH #clustering #database #effectiveness #object-oriented: Effective Clustering of Complex Objects in Object-Oriented Databases (JbRC, ARH), pp. 22–31.
SIGMOD-1991-KellerGM #assembly #performance: Efficient Assembly of Complex Objects (TK, GG, DM), pp. 148–157.
SIGMOD-1991-VandenbergD #algebra #array #inheritance: Algebraic Support for Complex Objects with Arrays, Identity, and Inheritance (SLV, DJD), pp. 158–167.
STOC-1991-AbiteboulV #complexity: Generic Computation and Its Complexity (SA, VV), pp. 209–219.
STOC-1991-NisanW #communication #complexity #revisited: Rounds in Communication Complexity Revisited (NN, AW), pp. 419–429.
WSA-1991-DornicJG #complexity #polymorphism: Polymorphic Time Systems for Estimating Program Complexity (VD, PJ, DKG), pp. 9–17.
ICALP-1991-DiekertOR #complexity #confluence #decidability #on the: On Confluent Semi-Commutations — Decidability and Complexity Results (VD, EO, KR), pp. 229–241.
ICALP-1991-Gurevich #complexity: Average Case Complexity (YG), pp. 615–628.
VDME-1991-1-McParlandK #programming language #specification: A Specification of a Complex Programming Language Statement (PM, PK), pp. 658–667.
FPCA-1991-VolpanoS #complexity #ml #on the: On the Complexity of ML Typability with Overloading (DMV, GS), pp. 15–28.
CHI-1991-FischerS #information management: Information access in complex, poorly structured information spaces (GF, CS), pp. 63–70.
CHI-1991-GaverSO #effectiveness #simulation: Effective sounds in complex systems: the ARKOLA simulation (WWG, RBS, TO), pp. 85–90.
KDD-1991-ManagoK #induction: Induction of Decision Trees from Complex Structured Data (MM, YK), pp. 289–308.
KR-1991-DoniniLNN #complexity #concept: The Complexity of Concept Languages (FMD, ML, DN, WN), pp. 151–162.
ML-1991-Ring #behaviour #development #incremental: Incremental Development of Complex Behaviors (MBR), pp. 343–347.
ML-1991-Whitehead #complexity: Complexity and Cooperation in Q-Learning (SDW), pp. 363–367.
ECOOP-1991-WolinskiP #multi #representation: Representation of Complex Objects: Multiple Facets with Part-Whole Hierarchies (FW, JFP), pp. 288–306.
POPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus: The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.
CAV-1991-FeigenbaumKL #complexity: Complexity Results for POMSET Languages (JF, JAK, CL), pp. 343–353.
CSL-1991-Fernando #bisimulation #complexity #logic #recursion #set: A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation (TF), pp. 96–110.
ICLP-1991-CharlierMH #abstract interpretation #algorithm #analysis #complexity: A Generic Abstract Interpretation Algorithm and its Complexity Analysis (BLC, KM, PVH), pp. 64–78.
ICLP-1991-DebrayL #analysis #automation #complexity #logic programming #source code: Automatic Complexity Analysis of Logic Programs (SKD, NWL), pp. 599–613.
LICS-1991-Hungar #bound #complexity #hoare #proving: Complexity Bounds of Hoare-style Proof Systems (HH), pp. 120–126.
DAC-1990-ChengA #complexity #multi: An Entropy Measure for the Complexity of Multi-Output Boolean Functions (KTC, VDA), pp. 302–305.
SIGMOD-1990-UllmanY #complexity #transitive: The Input/Output Complexity of Transitive Closure (JDU, MY), pp. 44–53.
VLDB-1990-KaferRS: Support for Temporal Data by Complex Objects (WK, NR, HS), pp. 24–35.
VLDB-1990-OnoL #complexity #optimisation #query: Measuring the Complexity of Join Enumeration in Query Optimization (KO, GML), pp. 314–325.
VLDB-1990-SchneiderD #database #multi #query #trade-off: Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines (DAS, DJD), pp. 469–480.
ESOP-1990-Sands #analysis #complexity #higher-order #lazy evaluation: Complexity Analysis for a Lazy Higher-Order Language (DS), pp. 361–376.
STOC-1990-BeaverMR #complexity #protocol: The Round Complexity of Secure Protocols (Extended Abstract) (DB, SM, PR), pp. 503–513.
STOC-1990-BellareMO90a #complexity #statistics: The (True) Complexity of Statistical Zero Knowledge (MB, SM, RO), pp. 494–502.
STOC-1990-Lakshman #complexity #on the: On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal (YNL), pp. 555–563.
STOC-1990-MansourNT #complexity: The Computational Complexity of Universal Hashing (YM, NN, PT), pp. 235–243.
STOC-1990-PapadimitriouSY #complexity #on the: On the Complexity of Local Search (Extended Abstract) (CHP, AAS, MY), pp. 438–445.
STOC-1990-Szegedy #bound #communication #complexity #symmetry: Functions with Bounded Symmetric Communication Complexity and Circuits with mod m Gates (MS), pp. 278–286.
ICALP-1990-GoodrichAO #trade-off: An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version) (MTG, MJA, MHO), pp. 689–702.
ICALP-1990-PanR #multi #on the: On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid (VYP, JHR), pp. 612–625.
ICALP-1990-Razborov #complexity #on the: On the Distributional Complexity of Disjontness (AAR), pp. 249–253.
VDME-1990-GiovanniI #development: HOOD and Z for the Development of Complex Software Systems (RDG, PLI), pp. 262–289.
ML-1990-Valtorta #complexity #knowledge base #network #refinement: More Results on the Complexity of Knowledge Base Refinement: Belief Networks (MV), pp. 419–426.
OOPSLA-ECOOP-1990-McDonaldSB #multi: Painting Multiple Views of Complex Objects (JAM, WS, AB), pp. 245–257.
ALP-1990-Li #complexity #optimisation: Optimization of Rewriting and Complexity of Rewriting (KL), pp. 359–371.
CAV-1990-HamaguchiHY #branch #complexity #linear #logic #model checking: Branching Time Regular Temporal Logic for Model Checking with Linear Time Complexity (KH, HH, SY), pp. 253–262.
CSL-1990-BlassG #complexity #on the #reduction: On the Reduction Theory for Average Case Complexity (AB, YG), pp. 17–30.
CSL-1990-Mundici #adaptation #complexity: The Complexity of Adaptive Error-Correcting Codes (DM), pp. 300–307.
LICS-1990-AlurH #complexity #logic #realtime: Real-time Logics: Complexity and Expressiveness (RA, TAH), pp. 390–401.
NACLP-1990-CoxMT #complexity #constraints #logic programming #programming language: Computational Complexity and Constraint Logic Programming Languages (JC, KM, CT), pp. 401–415.
DAC-1989-HwangOI #communication #complexity #logic #multi #synthesis #using: Multi-Level Logic Synthesis Using Communication Complexity (TH, RMO, MJI), pp. 215–220.
PODS-1989-ChenW: C-Logic of Complex Objects (WC, DSW), pp. 369–378.
PODS-1989-ImielinskiV #complexity #database #query: Complexity of Query Processing in Databases with OR-Objects (TI, KVV), pp. 51–65.
PODS-1989-LecluseR #database #modelling #object-oriented: Modeling Complex Structures in Object-Oriented Databases (CL, PR), pp. 360–368.
SIGMOD-1989-Cohen #compilation #database: Compiling Complex Database Transition Triggers (DC), pp. 225–234.
SIGMOD-1989-HullS #complexity #database #object-oriented #on the #strict: On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions (Extended Abstract) (RH, JS), pp. 147–158.
VLDB-1989-GardarinCKPS #relational: Managing Complex Objects in an Extensible Relational DBMS (GG, JPC, GK, DP, HS), pp. 55–65.
VLDB-1989-Mitschang #algebra #relational: Extending the Relational Algebra to Capture Complex Objects (BM), pp. 297–305.
STOC-1989-AlonBLP #communication #complexity #on the: On the Complexity of Radio Communication (Extended Abstract) (NA, ABN, NL, DP), pp. 274–285.
STOC-1989-Ben-DavidCGL #complexity #formal method #on the: On the Theory of Average Case Complexity (SBD, BC, OG, ML), pp. 204–216.
STOC-1989-FredmanS #complexity #data type: The Cell Probe Complexity of Dynamic Data Structures (MLF, MES), pp. 345–354.
ICALP-1989-HochbaumS #complexity #optimisation: The Complexity of Nonlinear Separable Optimization (DSH, JGS), pp. 461–472.
ICALP-1989-LiV89a #approach #complexity #formal method: A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version) (ML, PMBV), pp. 506–520.
ICALP-1989-McKenzieT #automaton #complexity: Automata Theory Meets Circuit Complexity (PM, DT), pp. 589–602.
ICALP-1989-PruhsM #complexity: The Complexity of Controlled Selection (KP, UM), pp. 672–686.
ICALP-1989-Toran #combinator #complexity: A Combinatorial Technique for Separating Counting Complexity Classes (JT), pp. 733–744.
FPCA-1989-Rosendahl #analysis #automation #complexity: Automatic Complexity Analysis (MR), pp. 144–156.
FPCA-1989-WandO #complexity #on the #type inference: On the Complexity of Type Inference with Coercion (MW, PO), pp. 293–298.
CAiSE-1989-CacaceCCGLLTZ #database #named #prototype #relational #specification: ALGRES: An Extended Relational Database System for the Specification and Prototyping of Complex Applications (FC, SC, SCR, GG, GL, LL, LT, RVZ).
KR-1989-BylanderATJ #abduction #complexity: Some Results Concerning the Computational Complexity of Abduction (TB, DA, MCT, JRJ), pp. 44–54.
ML-1989-RudyK #learning: Learning to Plan in Complex Domains (DR, DFK), pp. 180–182.
ML-1989-Valtorta #complexity #knowledge-based #refinement: Some Results on the Complexity of Knowledge-Based Refinement (MV), pp. 326–331.
SEKE-1989-FanH #complexity #metric: A Comprehensive Software Complexity Metric for Primitive Modules (ZF, JMH), pp. 67–72.
ICSE-1989-MunsonK #complexity: The Dimensionality of Program Complexity (JCM, TMK), pp. 245–253.
ICSE-1989-NakagawaH #complexity #fault #metric #reliability: An Error Complexity Model for Software Reliability Measurement (YN, SH), pp. 230–236.
CSL-1989-Dahlhaus #complexity #linear: The Complexity of Subtheories of the Existential Linear Theory of Reals (ED), pp. 76–89.
CSL-1989-Gradel #complexity #concept #logic #on the: On Logical Descriptions of Some Concepts in Structural Complexity Theory (EG), pp. 163–175.
CSL-1989-SpeckenmeyerK #clustering #complexity #on the #set: On the Average Time Complexity of Set Partitioning (ES, RK), pp. 369–381.
CSL-1989-Wette #complexity #recursion #representation: Sequential Representation of Primitive Recursive Functions, and Complexity Classes (EW), pp. 422–437.
LICS-1989-Goerdt #complexity #recursion: Characterizing Complexity Classes By Higher Type Primitive Recursive Definitions (AG), pp. 364–374.
LICS-1989-Stolboushkin #bound #complexity #logic: Some Complexity Bounds for Dynamic Logics (APS), pp. 324–332.
LICS-1989-Vardi #complexity #on the #reasoning: On the Complexity of Epistemic Reasoning (MYV), pp. 243–252.
RTA-1989-NaoiI #algebra #complexity #semantics #term rewriting: Algebraic Semantics and Complexity of Term Rewriting Systems (TN, YI), pp. 311–325.
PODS-1988-BunemanDW #approximate #query #semantics: A Semantics for Complex Objects and Approximate Queries (PB, SBD, AW), pp. 305–314.
PODS-1988-UllmanV #complexity: The Complexity of Ordering Subgoals (JDU, MYV), pp. 74–81.
SIGMOD-1988-ChenG #implementation #reasoning: An Implementation Model for Reasoning with Complex Objects (QC, GG), pp. 164–172.
VLDB-1988-AdibaC: Management of Complex Objects as Dynamic Forms (MEA, CC), pp. 134–147.
ESOP-1988-Heckmann #functional #specification: A Functional Language for the Specification of Complex Tree Transformations (RH), pp. 175–190.
ESOP-1988-Heckmann88a #functional #specification: A Functional Language for the Specification of Complex Tree Transformations (System Exhibition) (RH), p. 380.
STOC-1988-HajnalMT #communication #complexity #graph #on the: On the Communication Complexity of Graph Properties (AH, WM, GT), pp. 186–191.
STOC-1988-King #bound #complexity #graph: Lower Bounds on the Complexity of Graph Properties (VK), pp. 468–476.
STOC-1988-PapadimitriouY88a #approximate #complexity #optimisation: Optimization, Approximation, and Complexity Classes (Extended Abstract) (CHP, MY), pp. 229–234.
ICALP-1988-AggarwalC #communication #complexity: Communication Complexity of PRAMs (Preliminary Version) (AA, AKC), pp. 1–17.
ICALP-1988-AlbertF #algorithm #analysis #complexity #multi: Average Case Complexity Analysis of the Rete Multi-Pattern Match Algorithm (LA, FF), pp. 18–37.
ICALP-1988-DietzfelbingerM #complexity #matrix #turing machine: The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
ICALP-1988-Hartmanis #complexity: New Developments in Structural Complexity Theory (JH), pp. 271–286.
ICALP-1988-KruskalRS #algorithm #complexity #parallel #performance: A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract) (CPK, LR, MS), pp. 333–346.
ICALP-1988-Watanabe #complexity #nondeterminism #on the: On ≤ᴾ₁₋tt-Sparseness and Nondeterministic Complexity Classes (Extended Abstract) (OW0), pp. 697–709.
ICSE-1988-HarelLNPPSS #development: STATEMATE; A Working Environment for the Development of Complex Reactive Systems (DH, HL, AN, AP, MP, RS, AST), pp. 396–406.
CSL-1988-Goerdt #complexity #recursion: Characterizing Complexity Classes by General Recursive Definitions in Higher Types (AG), pp. 99–117.
CSL-1988-Gradel #complexity #modelling #nondeterminism: Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes (EG), pp. 118–137.
CSL-1988-Karpinski #algebra #complexity #problem: Boolean Complexity of Algebraic Interpolation Problems (MK), pp. 138–147.
CSL-1988-Niemela #complexity #logic #on the #problem: On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic (IN), pp. 226–239.
CSL-1988-OchozkaSS #complexity #logic programming #normalisation #source code: Normal Forms and the Complexity of Computations of Logic Programs (VO, OS, PS), pp. 357–371.
JICSCP-1988-Kaplan88 #algorithm #complexity #logic programming #source code: Algorithmic Complexity of Logic Programs (SK), pp. 780–793.
DAC-1987-RajsumanMJ #fault #modelling #on the: On Accuracy of Switch-Level Modeling of Bridging Faults in Complex Gates (RR, YKM, APJ), pp. 244–250.
PODS-1987-AfratiP #complexity #parallel #query: The Parallel Complexity of Simple Chain Queries (FNA, CHP), pp. 210–213.
PODS-1987-Marchetti-SpaccamelaPS #analysis #complexity #implementation #logic #query #worst-case: Worst-case Complexity Analysis of Methods for Logic Query Implementation (AMS, AP, DS), pp. 294–301.
STOC-1987-BilardiP #complexity #network: Size-Time Complexity of Boolean Networks for Prefix Computations (GB, FPP), pp. 436–442.
STOC-1987-ChazelleEG #complexity: The Complexity of Cutting Convex Polytopes (BC, HE, LJG), pp. 66–76.
STOC-1987-Fortnow #complexity: The Complexity of Perfect Zero-Knowledge (Extended Abstract) (LF), pp. 204–209.
STOC-1987-Furer #communication #complexity #power of: The Power of Randomness for Communication Complexity (Preliminary Version) (MF), pp. 178–181.
STOC-1987-Kaltofen #complexity: Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials (EK), pp. 443–452.
STOC-1987-MillerT #complexity #parallel: Dynamic Parallel Complexity of Computational Circuits (GLM, SHT), pp. 254–263.
STOC-1987-Smolensky #algebra #bound #complexity #formal method: Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity (RS), pp. 77–82.
ICALP-1987-AggarwalV #complexity #problem #sorting: The I/O Complexity of Sorting and Related Problems (Extended Abstract) (AA, JSV), pp. 467–478.
ICALP-1987-CaiM #complexity #graph #on the: On the Complexity of Graph Critical Uncolorability (JyC, GEM), pp. 394–403.
ICALP-1987-LiY #complexity #parallel #probability #symmetry: The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions (ML, YY), pp. 326–335.
ICALP-1987-MehlhornNA #bound #complexity #problem: A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.
ICALP-1987-Muller #complexity: Uniform Computational Complexity of Taylor Series (NTM), pp. 435–444.
HCI-CE-1987-AnzaiMIH #problem: A Serial-Parallel Integrated Information-Processing Model for Complex Human Problem Solving (YA, HM, MI, YH), pp. 175–182.
HCI-CE-1987-Moser #comprehension #debugging #design #using #visual notation: Understanding Complex Software Systems Using GADD: A Tool for Graphical Animated Design and Debugging (MCM), pp. 449–456.
HCI-CE-1987-Springer #identification #pretty-printing #retrieval: Retrieval of Information from Complex Alphanumeric Displays: Screen Formatting Variables’ Effects on Target Identification Time (CJS), pp. 375–382.
HCI-SES-1987-McKendree #feedback: Feedback Content During Complex Skill Acquisition (JM), pp. 181–188.
ASPLOS-1987-DavidsonV #complexity #memory management #performance #set: The Effect of Instruction Set Complexity on Program Size and Memory Performance (JWD, RAV), pp. 60–64.
CSL-1987-KarpinskiBS #complexity #horn clause #on the #quantifier: On the Computational Complexity of Quantified Horn Clauses (MK, HKB, PHS), pp. 129–137.
CSL-1987-LenzW #complexity #polynomial: The Conjunctive Complexity of Quadratic Boolean Functions (KL, IW), pp. 138–150.
CSL-1987-Schoning #complexity: Complexity Cores and Hard-To-Prove Formulas (US), pp. 273–280.
CSL-1987-Speckenmeyer #backtracking #complexity #on the #problem #satisfiability: On the Average Case Complexity of Backtracking for the Exact-Satisfiability Problem (ES), pp. 281–288.
RTA-1987-Benois #algorithm #automaton #complexity #regular expression #term rewriting: Descendants of Regular Language in a Class of Rewriting Systems: Algorithm and Complexity of an Automata Construction (MB), pp. 121–132.
RTA-1987-ChoppyKS #algorithm #complexity #term rewriting: Algorithmic Complexity of Term Rewriting Systems (CC, SK, MS), pp. 256–273.
SLP-1987-BarklundM87 #data type #prolog: Integrating Complex Data Structures in Prolog (JB, HM), pp. 415–425.
DAC-1986-Janni #monitoring: A monitor for complex CAD systems (ADJ), pp. 145–151.
PODS-1986-BancilhonK #calculus: A Calculus for Complex Objects (FB, SK), pp. 53–60.
VLDB-1986-ValduriezKC #implementation: Implementation Techniques of Complex Objects (PV, SK, GPC), pp. 101–110.
STOC-1986-HalpernV #complexity #reasoning: The Complexity of Reasoning about Knowledge and Time: Extended Abstract (JYH, MYV), pp. 304–315.
STOC-1986-Krentel #complexity #optimisation #problem: The Complexity of Optimization Problems (MWK), pp. 69–76.
ICALP-1986-HartmanisH #complexity: Complexity Classes Without Machines: On Complete Languages for UP (JH, LAH), pp. 123–135.
ICALP-1986-HartmanisLY #complexity #set: Containment, Separation, Complete Sets, and Immunity of Complexity Classes (JH, ML, YY), pp. 136–145.
ICALP-1986-Muller #complexity: Subpolynomial Complexity Classes of Real Functions and Real Numbers (NTM), pp. 284–293.
ICALP-1986-MullerSS #automaton #complexity #monad: Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
ICALP-1986-RosierY #complexity #concurrent #finite #on the #probability #source code #termination: On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
GG-1986-AalbersbergER #complexity #strict: Restricting the complexity of regular DNLC languages (IJA, JE, GR), pp. 147–166.
GG-1986-CarlyleGP #complexity #generative #parallel: Complexity of pattern generation via planar parallel binary fission/fusion grammars (JWC, SAG, AP), pp. 515–533.
CSCW-1986-CashmanS #complexity #theory and practice: Achieving sustainable complexity through information technology: theory and practice (PMC, DS), pp. 307–317.
ICLP-1986-MannilaU86 #complexity #on the #sequence #unification: On the Complexity of Unification Sequences (HM, EU), pp. 122–133.
PODS-1985-PapadimitriouY #complexity #concurrent #reliability: The Complexity of Reliable Concurrency Control (CHP, MY), pp. 230–234.
PODS-1985-Ramarao #commit #complexity #on the #protocol: On the Complexity of Commit Protocols (KVSR), pp. 235–244.
SIGMOD-1985-KlaholdSUW #information management #transaction: A Transaction Model Supporting Complex Applications in Integrated Information Systems (PK, GS, RU, WW), pp. 388–401.
VLDB-1985-SheardS #automation #complexity #database #reasoning: Coping with Complexity in Automated Reasoning about Database Systems (TS, DWS), pp. 426–435.
VLDB-1985-Zaniolo #deduction #representation #retrieval: The Representation and Deductive Retrieval of Complex Objects (CZ), pp. 458–469.
STOC-1985-CarterSW #backtracking #complexity: The Complexity of Backtrack Searches (Preliminary Version) (LC, LJS, MNW), pp. 449–457.
STOC-1985-FichT #complexity #finite #parallel: The Parallel Complexity of Exponentiating Polynomials over Finite Fields (FEF, MT), pp. 38–47.
STOC-1985-GoldwasserMR #complexity #interactive: The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) (SG, SM, CR), pp. 291–304.
STOC-1985-Huynh #commutative #complexity #equivalence #problem #symmetry: The Complexity of the Equivalence Problem for Commutative Semigroups and Symmetric Vector Addition Systems (DTH), pp. 405–412.
STOC-1985-Vazirani #communication #complexity #generative #sequence #towards: Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) (UVV), pp. 366–378.
ICALP-1985-BilardiP #complexity #sorting: The Influence of Key Length on the Area-Time Complexity of Sorting (GB, FPP), pp. 53–62.
ICALP-1985-Li #bound: Lower Bounds by Kolmogorov-Complexity (Extended Abstract) (ML0), pp. 383–393.
ICALP-1985-OrponenRS #complexity #polynomial: Polynomial Levelability and Maximal Complexity Cores (PO, DAR, US), pp. 435–444.
RTA-1985-BenanavKN #complexity #problem: Complexity of Matching Problems (DB, DK, PN), pp. 417–429.
DAC-1984-BellonV #functional: Taking into account asynchronous signals in functional test of complex circuits (CB, RV), pp. 490–496.
PODS-1984-GrahamV #axiom #complexity #consistency #database #on the: On the Complexity and Axiomatizability of Consistent Database States (MHG, MYV), pp. 281–289.
VLDB-1984-DeenAT #query: A Strategy for Decomposing Complex Queries in a Heterogeneous DDB (SMD, RRA, MCT), pp. 397–400.
STOC-1984-Ben-OrKR #algebra #complexity #geometry: The Complexity of Elementary Algebra and Geometry (Preliminary Abstract) (MBO, DK, JHR), pp. 457–464.
STOC-1984-DurisGS #bound #communication #complexity: Lower Bounds on Communication Complexity (PD, ZG, GS), pp. 81–91.
STOC-1984-Leighton #bound #complexity #parallel #sorting: Tight Bounds on the Complexity of Parallel Sorting (FTL), pp. 71–80.
ICALP-1984-AfratiPP #complexity #graph: The Complexity of Cubical Graphs (Extended Abstract) (FNA, CHP, GP), pp. 51–57.
ICALP-1984-ChazelleOSW #complexity #decidability: The Complexity and Decidability of Separation (BC, TO, ESS, DW), pp. 119–127.
ICALP-1984-Hromkovic #communication #complexity: Communication Complexity (JH), pp. 235–246.
ICALP-1984-Jerrum #complexity #generative #sequence: The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract) (MJ), pp. 270–280.
ICALP-1984-Jung #complexity #matrix #on the #performance #probability #problem: On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract) (HJ), pp. 281–291.
ICALP-1984-Vitter #complexity #interface: Computational Complexity of an Optical Disk Interface (Extended Abstract) (JSV), pp. 490–502.
ICSE-1984-BiggerstaffEF #editing #named #object-oriented: TABLE: Object Oriented Editing of Complex Structures (TJB, DME, IRF), pp. 334–345.
ICSE-1984-Elshoff #complexity #metric: Characteristic Program Complexity Measures (JLE), pp. 288–293.
ICSE-1984-ParnasCW #composition: The Modular Structure of Complex Systems (DLP, PCC, DMW), pp. 408–419.
ICSE-1984-Tai #complexity #data flow #graph #metric: A Program Complexity Metric Based on Data Flow Information in Control Graphs (KCT), pp. 239–249.
CADE-1984-PelinG #algebra #complexity #problem #using #word: Solving Word Problems in Free Algebras Using Complexity Functions (AP, JHG), pp. 476–495.
DAC-1983-Tendolkar: Diagnosis of TCM failures in the IBM 3081 Processor complex (NNT), pp. 196–200.
PODS-1983-Cosmadakis #complexity #query #relational: The Complexity of Evaluating Relational Queries (SSC), pp. 149–155.
STOC-1983-Engelfriet #automaton #complexity: Iterated Pushdown Automata and Complexity Classes (JE), pp. 365–373.
STOC-1983-Immerman #complexity: Languages Which Capture Complexity Classes (Preliminary Report) (NI), pp. 347–354.
STOC-1983-Sipser #complexity #set: Borel Sets and Circuit Complexity (MS), pp. 61–69.
STOC-1983-Sipser83a #approach #complexity: A Complexity Theoretic Approach to Randomness (MS), pp. 330–335.
STOC-1983-Stockmeyer #approximate #complexity: The Complexity of Approximate Counting (Preliminary Version) (LJS), pp. 118–126.
ICALP-1983-Gabarro #complexity: Initial Index: A New Complexity Function for Languages (JG), pp. 226–236.
ICALP-1983-Indermark #complexity #infinity: Complexity of Infinite Trees (KI), pp. 347–360.
ICALP-1983-Orponen #complexity: Complexity Classes of Alternating Machines with Oracles (PO), pp. 573–584.
ICALP-1983-RestM #complexity #finite #on the: On the Group Complexity of a Finite Language (EBLR, SWM), pp. 433–444.
DAC-1982-Adshead #algorithm #complexity #hardware #problem #question #scalability #towards: Towards VLSI complexity: The DA algorithm scaling problem: can special DA hardware help? (HGA), pp. 339–344.
STOC-1982-Greenberg #communication #complexity #on the: On the Time Complexity of Broadcast Communication Schemes (Preliminary Version) (AGG), pp. 354–364.
STOC-1982-PapadimitriouS #communication #complexity: Communication Complexity (CHP, MS), pp. 196–200.
STOC-1982-PapadimitriouY #complexity: The Complexity of Facets (and Some Facets of Complexity) (CHP, MY), pp. 255–260.
STOC-1982-SistlaC #complexity #linear #logic: The Complexity of Propositional Linear Temporal Logics (APS, EMC), pp. 159–168.
STOC-1982-Vardi #complexity #query #relational: The Complexity of Relational Query Languages (Extended Abstract) (MYV), pp. 137–146.
ICALP-1982-SelmanY #complexity #problem: The Complexity of Promise Problems (ALS, YY), pp. 502–509.
ICSE-1982-PotierAFB #complexity #reliability: Experiments with Computer Software Complexity and Reliability (DP, JLA, RF, AB), pp. 94–103.
ILPC-1982-Shapiro82 #complexity #logic programming #source code: Alternation and the Computational Complexity of Logic Programs (EYS), pp. 154–163.
DAC-1981-BellonSG #hardware: Hardware description levels and test for complex circuits (CB, GS, JMG), pp. 213–219.
STOC-1981-AdachiIK #combinator #complexity #game studies #low level: Low Level Complexity for Combinatorial Games (AA, SI, TK), pp. 228–237.
STOC-1981-Chan #complexity: Reversal Complexity of Counter Machines (ThC), pp. 146–157.
STOC-1981-ChazelleM #complexity: A Model of Computation for VLSI with Related Complexity Results (BC, LM), pp. 318–325.
STOC-1981-HongK #complexity #game studies: I/O Complexity: The Red-Blue Pebble Game (JWH, HTK), pp. 326–333.
STOC-1981-Leivant #complexity #independence #parametricity #polymorphism #programming language #theorem: The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) (DL), pp. 38–45.
STOC-1981-Orlin #complexity #optimisation #problem: The Complexity of Dynamic Languages and Dynamic Optimization Problems (JBO), pp. 218–227.
STOC-1981-Simon #bound #complexity #probability #turing machine: Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) (JS), pp. 158–167.
ICALP-1981-GurariI #complexity #multi #problem: The Complexity of Decision Problems for Finite-Turn Multicounter Machines (EMG, OHI), pp. 495–505.
ICALP-1981-IbarraLM #complexity #on the: On the Complexity of Simple Arithmetic Expressions (OHI, BSL, SM), pp. 294–304.
ICALP-1981-Lieberherr #complexity: Uniform Complexity and Digital Signatures (KJL), pp. 530–543.
ICSE-1981-SunoharaTUO #complexity #development: Program Complexity Measure for Software Development Management (TS, AT, KU, TO), pp. 100–106.
DAC-1980-Donath #automation #complexity #design: Complexity theory and design automation (WED), pp. 412–419.
DAC-1980-SahniB #automation #complexity #design #problem: The complexity of design automation problems (SS, AB), pp. 402–411.
VLDB-1980-ShneidermanT #automation #database #query: Path Expressions for Complex Queries and Automatic Database Program Conversion (BS, GT), pp. 33–44.
STOC-1980-BrentK #complexity: The Chip Complexity of Binary Arithmetic (RPB, HTK), pp. 190–200.
STOC-1980-EhrigM #algebra #complexity #implementation #specification: Complexity of Implementations on the Level of Algebraic Specifications (HE, BM), pp. 281–293.
STOC-1980-Hong #complexity #on the #problem: On Some Deterministic Space Complexity Problems (JWH), pp. 310–317.
STOC-1980-IbarraL #complexity #equivalence #problem #source code: The Complexity of the Equivalence Problem for Straight-Line Programs (OHI, BSL), pp. 273–280.
STOC-1980-KarpL #complexity: Some Connections between Nonuniform and Uniform Complexity Classes (RMK, RJL), pp. 302–309.
ICALP-1980-Furer #complexity #problem #regular expression: The Complexity of the Inequivalence Problem for Regular Expressions with Intersection (MF), pp. 234–245.
ICALP-1980-Huynh #complexity #linear #set: The Complexity of Semilinear Sets (TDH), pp. 324–337.
ICALP-1980-Snir #complexity #on the: On the Size Complexity of Monotone Formulas (MS), pp. 621–631.
POPL-1980-Parikh #complexity #logic #modelling #source code: Propositional Logics of Programs: Systems, Models, and Complexity (RP), pp. 186–192.
SIGMOD-1979-HuntR #complexity #testing: The Complexity of Testing Predicate Locks (HBHI, DJR), pp. 127–133.
STOC-1979-DeMilloL #complexity #logic: Some Connections between Mathematical Logic and Complexity Theory (RAD, RJL), pp. 153–159.
STOC-1979-GurariI #complexity #equivalence #linear #problem #set #source code: The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
STOC-1979-JaJa #commutative #complexity #on the: On the Complexity of Bilinear Forms with Commutativity (JJ), pp. 197–208.
STOC-1979-Ladner #communication #complexity #csp #problem #process: The Complexity of Problems in Systems of Communicating Sequential Processes (Extended Abstract) (REL), pp. 214–223.
STOC-1979-SedgewickS #complexity: The Complexity of Finding Periods (RS, TGS), pp. 74–80.
STOC-1979-Thompson #complexity: Area-Time Complexity for VLSI (CDT), pp. 81–88.
STOC-1979-Yao #complexity: Some Complexity Questions Related to Distributive Computing (Preliminary Report) (ACCY), pp. 209–213.
ICALP-1979-BookB #complexity #representation #set #similarity: Representing Complexity Classes by Equality Sets (Preliminary Report) (RVB, FJB), pp. 49–57.
ICALP-1979-PapadimitriouY #complexity #problem #strict: The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.
ICALP-1979-Ruzzo #complexity #context-free grammar #on the #parsing #recognition: On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract) (WLR), pp. 489–497.
ICSE-1979-CurtisSM #complexity #metric #performance #predict #replication: Third Time Charm: Stronger Replication of the Ability of Software Complexity Metrics to Predict Programmer Performance (BC, SBS, PM), pp. 356–360.
DAC-1978-Baer #maintenance: Maintaining integrity in complex shape definitions (AB), pp. 9–15.
STOC-1978-Lewis #complexity #on the #problem: On the Complexity of the Maximum Subgraph Problem (JML), pp. 265–274.
STOC-1978-Lynch #complexity #metric #parametricity: Straight-Line Program Length as a Parameter for Complexity Measures (NAL), pp. 150–161.
STOC-1978-Pan #complexity: Computational Complexity of Computing Polynomials over the Fields of Real and Complex Numbers (VYP), pp. 162–172.
STOC-1978-Schaefer #complexity #problem #satisfiability: The Complexity of Satisfiability Problems (TJS), pp. 216–226.
STOC-1978-Wegener #complexity #polynomial: Switching Functions Whose Monotone Complexity Is Nearly Quadratic (IW), pp. 143–149.
ICALP-1978-Berman #complexity: Relationship Between Density and Deterministic Complexity of NP-Complete Languages (PB), pp. 63–71.
ICALP-1978-FortuneHS #complexity #equivalence #for free: The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (SF, JEH, EMS), pp. 227–240.
ICALP-1978-Savitch #complexity #nondeterminism #parallel: Parallel and Nondeterministic Time Complexity Classes (Preliminary Report) (WJS), pp. 411–424.
GG-1978-PazR #complexity #generative: Complexity of Pattern Generation by Map-L-Systems (AP, YR), pp. 367–378.
POPL-1978-OgdenRR #complexity #concurrent: Complexity of Expressions Allowing Concurrency (WFO, WER, WCR), pp. 185–194.
ICSE-1978-McClure #analysis #complexity: A Model for Program Complexity Analysis (CLM), pp. 149–157.
DAC-1977-Somaia #automation #logic #testing: An automated simultaneous probing system for testing complex logic assemblies “the bed of nails system” (RHS), pp. 64–67.
VLDB-1977-HendrixSSS #interface #natural language: Developing a Natural Language Interface to Complex Data (GGH, EDS, DS, JS), p. 292.
STOC-1977-Brown #complexity #maintenance #queue: The Complexity of Priority Queue Maintenance (MRB), pp. 42–48.
STOC-1977-Hartmanis #complexity #proving: Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) (JH), pp. 223–227.
STOC-1977-Kozen #algebra #complexity: Complexity of Finitely Presented Algebras (DK), pp. 164–177.
ICALP-1977-Alton #complexity #memory management #metric: “Natural” Complexity Measures and Time versus Memory: Some Definitional Proposals (DAA), pp. 16–29.
ICALP-1977-Erni #complexity #on the: On the Time and Tape Complexity of Hyper(1)-AFL’s (WJE), pp. 230–243.
ICALP-1977-JonesS #complexity #problem: Complexity of Some Problems Concerning L Systems (NDJ, SS), pp. 301–308.
ICALP-1977-Sudborough #complexity: The Time and Tape Complexity of Developmental Languages (IHS), pp. 509–523.
STOC-1976-PapadimitriouS #complexity #problem: Some Complexity Results for the Traveling Salesman Problem (CHP, KS), pp. 1–9.
STOC-1976-Schaefer #complexity #finite #game studies #problem: Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games (TJS), pp. 41–49.
ICALP-1976-AltM #bound #complexity #recognition: Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.
POPL-1976-Hunt #complexity #problem: A Complexity Theory of Grammar Problems (HBHI), pp. 12–18.
ICSE-1976-McCabe #complexity: A Complexity Measure (Abstract) (TJM), p. 407.
VLDB-1975-DatheDH #database #design: Design Principles of a Data Base System for Unlimited Quantities of Data with Highly Complex Structures (GD, KHD, GH), pp. 546–548.
VLDB-1975-LienTDR #implementation #towards: Binary Search Tree Complex — Towards the Implementation of Relations (YEL, CET, JRD, MLR), pp. 540–542.
STOC-1975-Galil #bound #complexity #on the: On the Validity and Complexity of Bounded Resolution (ZG), pp. 72–82.
STOC-1975-GinsburgL #comparative #complexity: Comparative Complexity of Grammar Forms (SG, NAL), pp. 153–158.
STOC-1975-HuntS #complexity #on the #problem: On the Complexity of Grammar and Related Problems (HBHI, TGS), pp. 54–65.
STOC-1975-HyafilK #complexity #evaluation #linear #parallel: The Complexity of Parallel Evaluation of Linear Recurrence (LH, HTK), pp. 12–22.
STOC-1975-LiptonD #complexity #evaluation #integer #metric: Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms (RJL, DPD), pp. 1–5.
STOC-1975-LiptonED #complexity #data type: The Complexity of Control Structures and Data Structures (RJL, SCE, RAD), pp. 186–193.
STOC-1975-Paul #bound #combinator #complexity: A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions (WJP), pp. 27–36.
STOC-1975-Shamos #complexity #geometry: Geometric Complexity (MIS), pp. 224–233.
STOC-1975-Valiant #bound #complexity #on the: On Non-linear Lower Bounds in Computational Complexity (LGV), pp. 45–53.
STOC-1975-Wagner #complexity #on the #problem #string: On the Complexity of the Extended String-to-String Correction Problem (RAW), pp. 218–223.
POPL-1975-HuntSU #complexity #lr #on the #testing: On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.
POPL-1975-JazayeriOR #attribute grammar #complexity #on the: On the Complexity of the Circularity Test for Attribute Grammars (MJ, WFO, WCR), pp. 119–129.
STOC-1974-EhrenfeuchtZ #complexity #metric #regular expression: Complexity Measures for Regular Expressions (AE, HPZ), pp. 75–79.
STOC-1974-Gill #complexity #probability #turing machine: Computational Complexity of Probabilistic Turing Machines (JTGI), pp. 91–95.
STOC-1974-Miller #complexity: Computational Complexity and Numerical Stability (WM), pp. 317–322.
STOC-1974-Rackoff #complexity #on the: On the Complexity of the Theories of Weak Direct Products: A Preliminary Report (CR), pp. 149–160.
STOC-1974-Robertson #complexity #higher-order #monad: Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers (ELR), pp. 161–171.
ICALP-1974-Ausiello #complexity #recursion #semantics #source code: Relations between Semantics and Complexity of Recursive Programs (GA), pp. 129–140.
ICALP-1974-Book #complexity #on the: On the Structure of Complexity Classes (RVB), pp. 437–445.
ICALP-1974-Weihrauch #complexity: The Compuational Complexity of Program Schemata (KW), pp. 326–334.
STOC-1973-Constable #complexity: Type Two Computational Complexity (RLC), pp. 108–121.
STOC-1973-HopcroftM #complexity #matrix #multi: Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms (JEH, JM), pp. 73–87.
STOC-1973-Hunt #complexity #on the: On the Time and Tape Complexity of Languages I (HBHI), pp. 10–19.
STOC-1973-Kung #algebra #complexity: The Computational Complexity of Algebraic Numbers (HTK), pp. 152–159.
SIGIR-1973-Winograd #complexity: Breaking the Complexity Barrier again (TW), pp. 13–30.
STOC-1972-Cook #complexity #nondeterminism: A Hierarchy for Nondeterministic Time Complexity (SAC), pp. 187–192.
STOC-1972-Schnorr #complexity #effectiveness #process #random testing #testing: The Process Complexity and Effective Random Tests (CPS), pp. 168–176.
ICALP-1972-Bertoni #approximate #complexity #probability #problem: Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines (AB), pp. 507–516.
ICALP-1972-Boas #comparison #complexity: A Comparison of the Properties of Complexity Classes and Honesty Classes (PvEB), pp. 391–396.
ICALP-1972-Book #complexity #formal method: Complexity Classes of Formal Languages (Extended Abstract) (RVB), pp. 517–520.
ICALP-1972-Turner #approach #complexity #infinity: An Infinite Hierarchy of Term Languages — An Approach to Mathematical Complexity (RT), pp. 593–608.
STOC-1971-ConstableH #complexity: Complexity of Formal Translations and Speed-Up Results (RLC, JH), pp. 244–250.
STOC-1971-Cook #complexity: The Complexity of Theorem-Proving Procedures (SAC), pp. 151–158.
STOC-1971-Robertson #complexity #recursion: Complexity Classes of Partial Recursive Functions (Preliminary Version) (ELR), pp. 258–266.
SIGFIDET-1970-BracchiFS #data type #multi: A Multilevel Data Structure for Complex Hierarchies of Interrelated Data (GB, DF, MS), pp. 246–275.
STOC-1970-BassY #complexity #set: Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (Preliminary Report) (LJB, PRY), pp. 37–40.
STOC-1970-Burkhard #complexity #problem #realtime: Complexity Problems in Real Time Computation (WAB), pp. 62–69.
STOC-1970-LandweberR #complexity #recursion: Recursive Properties of Abstract Complexity Classes (Preliminary Version) (LHL, ELR), pp. 31–36.
STOC-1970-Lewis #complexity: Unsolvability Considerations in Computational Complexity (FDL), pp. 22–30.
STOC-1969-Avizienis #complexity #on the #problem: On the Problem of Computational Time and Complexity of Arithmetic Functions (AA), pp. 255–258.
STOC-1969-Borodin #complexity #recursion: Complexity Classes of Recursive Functions and the Existence of Complexity Gaps (AB), pp. 67–78.
STOC-1969-Hodes #complexity #geometry #logic: The Logical Complexity of Geometric Properties in the Plane (LH), pp. 249–254.
STOC-1969-Loveland #complexity #metric #on the: On Minimal-Program Complexity Measures (DWL), pp. 61–65.