The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Branching with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1948-1975 (16) 1976-1979 (18) 1980-1983 (24) 1984-1985 (23) 1986 (15) 1987 (22) 1988 (51) 1989 (26) 1990 (35) 1991 (37) 1992 (32) 1993 (33) 1994 (37) 1995 (48) 1996 (59) 1997 (53) 1998 (64) 1999 (60) 2000 (95) 2001 (110) 2002 (94) 2003 (124) 2004 (118) 2005 (163) 2006 (156) 2007 (151) 2008 (154) 2009 (141) 2010 (89) 2011 (68) 2012 (90) 2013 (95) 2014 (84) 2015 (85) 2016 (89) 2017 (109) 2018 (86) 2019 (98) 2020 (106) 2021 (112) 2022 (103) 2023 (98) 2024 (35)
Publication types (Num. hits)
article(1457) book(3) incollection(18) inproceedings(1795) phdthesis(32) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(241) Electron. Colloquium Comput. C...(92) J. Appl. Probab.(56) CONCUR(52) Theor. Comput. Sci.(48) MFCS(47) ICALP(37) CCC(36) CAV(28) IACR Cryptol. ePrint Arch.(27) LICS(27) STACS(26) STOC(26) FSTTCS(25) Inf. Comput.(25) REX Workshop(25) More (+10 of total 1118)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1415 occurrences of 909 keywords

Results
Found 3306 publication records. Showing 3306 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
117E. Allen Emerson, Joseph Y. Halpern "Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time. Search on Bibsonomy POPL The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
90Rob J. van Glabbeek, W. P. Weijland Branching Time and Abstraction in Bisimulation Semantics. Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF process algebra semantic equivalence, concurrency, abstraction, bisimulation, action refinement, branching time
82Joey Hwang, David G. Mitchell 2-Way vs. d-Way Branching for CSP. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
80Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. Search on Bibsonomy COCOON The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
77Andrew Gilpin, Tuomas Sandholm Information-theoretic approaches to branching in search. Search on Bibsonomy AAMAS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF branching heuristics, entropic branching, search, mixed-integer programming
76Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
76Detlef Sieling A separation of syntactic and nonsyntactic (1, +k)-branching programs. Search on Bibsonomy Comput. Complex. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF nonsyntactic, lower bound, Branching program, syntactic
75Nuel Belnap Norms in Branching Space-Times. Search on Bibsonomy DEON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
74E. Allen Emerson, Jai Srinivasan Branching time temporal logic. Search on Bibsonomy REX Workshop The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Modal and Temporal Logic: Branching time temporal logic, linear time temporal logic, model checking - Logics of Programs: Reasoning about concurrent programs, specification of and reasoning about fairness - Software Engineering: Specification techniques, automated verification techniques - Computational Complexity, Automata Theory: Finite-state automata on infinite objects, program verification, satisfiability, decidability, expressiveness, decision procedures, dynamic logics, tree automata, axiomatics, program specification, mechanical synthesis
69Tapio Elomaa, Matti Kääriäinen The Difficulty of Reduced Error Pruning of Leveled Branching Programs. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF reduced error pruning, approximability, NP-completeness, concept learning, branching programs
69Paul Beame, Michael E. Saks, Jayram S. Thathachar Time-Space Tradeoffs for Branching Programs. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF lower bounds, branching programs, time-space tradeoffs
68Petr Savický, Detlef Sieling A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
64Esteban Arcaute, Adam Kirsch, Ravi Kumar 0001, David Liben-Nowell, Sergei Vassilvitskii On threshold behavior in query incentive networks. Search on Bibsonomy EC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF query incentive networks, threshold phenomena, branching processes
63Alberto Del Bimbo, Luigi Rella, Enrico Vicario Visual Specification of Branching Time Temporal Logic. Search on Bibsonomy VL The full citation details ... 1995 DBLP  DOI  BibTeX  RDF branching time temporal logic, ordering relationships, visual shell, recursive syntax, mathematical notation, recursive visualization rules, generative approach, generic textual formula visualisation, 3D virtual space, branching time formulae, complex formulae, formal specification, parallel processing, parallelism, temporal logic, specification languages, visual languages, visual language, data visualisation, graphic representation, nesting, descriptive language, visual specification, time-varying systems, time-varying systems, execution sequencing
61Anna Gál, Michal Koucký 0001, Pierre McKenzie Incremental Branching Programs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
61Anna Gál, Michal Koucký 0001, Pierre McKenzie Incremental Branching Programs. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Anbulagan Extending Unit Propagation Look-Ahead of DPLL Procedure. Search on Bibsonomy PRICAI The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
56Paul Beame, Erik Vee Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
55Dusan Ristanovic, Nebojsa T. Milosevic, Herbert F. Jelinek, Ivan B. Stefanovic Mathematical modelling of neuronal dendritic branching patterns in two dimensions: application to retinal ganglion cells in the cat and rat. Search on Bibsonomy Biol. Cybern. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Branching points, Sholl’s analysis, Terminal tips, Logistic model, Retina
55Matti Järvisalo, Tommi A. Junttila Limitations of restricted branching in clause learning. Search on Bibsonomy Constraints An Int. J. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Branching heuristics, Clause learning, Backdoor sets, Proof complexity, Propositional satisfiability, DPLL, Problem structure
55Mark O. Riedl, Robert Michael Young From Linear Story Generation to Branching Story Graphs. Search on Bibsonomy IEEE Computer Graphics and Applications The full citation details ... 2006 DBLP  DOI  BibTeX  RDF automated story generation, branching stories, story graphs, narrative mediation, narrative planning, computer games, interactive storytelling, narrative intelligence
55Martin Sauerhoff On the size of randomized OBDDs and read-once branching programs for k-stable functions. Search on Bibsonomy Comput. Complex. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF read-once branching program, zero error, lower bounds, randomness, communication complexity, OBDD
55Nimrod Bayer, Yaakov Kogan Branching/queueing networks: Their introduction and near-decomposability asymptotics. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF nearly complete decomposability, closed queueing networks, branching processes
54James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio Orbital Branching. Search on Bibsonomy IPCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Kenzo Kurihara, Nobuyuki Nishiuchi, Manabu Nagai, Kazuaki Masuda Branching Probabilities Planning of Stochastic Network for Project Duration Planning. Search on Bibsonomy ETFA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
54Martin Sauerhoff Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract). Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
54Yen-Jen Oyang Exploiting multi-way branching to boost superscalar processor performance. Search on Bibsonomy ACM SIGPLAN Notices The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
54Christoph Meinel Restricted Branching Programs and Their Computational Power. Search on Bibsonomy MFCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
53Philipp Woelfel On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. Search on Bibsonomy CCC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Lower Bounds, BDDs, Nondeterminism, Branching Programs, Integer Multiplication
53Edmund M. Clarke, I. A. Draghicescu Expressibility results for linear-time and branching-time logics. Search on Bibsonomy REX Workshop The full citation details ... 1988 DBLP  DOI  BibTeX  RDF linear-time logic, temporal logic, fairness, computation tree logics, branching-time logic
48Vladimir V. Rybakov Branching Time Logics BTLU, SN, N-1(Z)a with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Logical consecutions, Admissible consecutions, Algorithms, Temporal logic, Decidability, Inference rules, Linear temporal logic, Branching time logic
48Sagar Chaki, Edmund M. Clarke, Orna Grumberg, Joël Ouaknine, Natasha Sharygina, Tayssir Touili, Helmut Veith State/Event Software Verification for Branching-Time Specifications. Search on Bibsonomy IFM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Concurrent Software Model Checking, State/Event-based Verification, Branching-time Temporal Logic, Automated Abstraction Refinement
48Martin Sauerhoff Randomized Branching Programs. Search on Bibsonomy SAGA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Randomized branching program, read-k-times, linear-length, lower bounds, randomness, nondeterminism, OBDD
48Beate Bollig, Philipp Woelfel A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF read-once branching programs, computational complexity, lower bounds, integer multiplication
47James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio Constraint Orbital Branching. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
47Samy Abbes, Albert Benveniste Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications. Search on Bibsonomy FoSSaCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
47Bian Runqiang, Yi-Ping Phoebe Chen, Kevin Burrage, Jim Hanan, Peter Room, John Belward Derivation of L-system Models from Measurements of Biological Branching Structures Using Genetic Algorithms. Search on Bibsonomy IEA/AIE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
47Beate Bollig Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
47Martin Sauerhoff On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions. Search on Bibsonomy STACS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
47Michaela Huhn, Peter Niebert Towards Automata for Branching Time and Partial Order. Search on Bibsonomy CONCUR The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
47Philippe Schnoebelen, Sophie Pinchinat On the Weak Adequacy of Branching-Time Remporal Logic. Search on Bibsonomy ESOP The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
47Ingo Wegener On the Complexity of Branching Programs and Decision Trees for Clique Functions. Search on Bibsonomy TAPSOFT, Vol.1 The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
44David Meyers, Shelley Skinner, Kenneth R. Sloan Surfaces from Contours. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF branching problem, branching surfaces, meshes, surface reconstruction, minimum spanning tree, tiling, surface fitting, correspondence problem
43Antonio Badia, Stijn Vansummeren Non-linear prefixes in query languages. Search on Bibsonomy PODS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF non-linear prefixes, branching, generalized quantifiers, cumulation
43Christian Maihöfer Bandwidth Analysis and Simulation of Reliable Multicast Transport Protocols. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF bandwidth analysis, branching factor, scope overlapping, reliable multicast
42Ilan Newman Testing of Functions that have small width Branching Programs. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF small width branching programs, combinatorial property testing, read-once branching programs, computational complexity, probability, probability, Boolean functions, Boolean functions, randomized algorithm, directed graphs, regular languages, randomised algorithms, decision problems, query complexity
42Ingo Wegener The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1994 DBLP  DOI  BibTeX  RDF optimal read-once branching programs, minimal read-once branching program size, reduction rules, size complexity, computational complexity, Boolean functions, Boolean functions, directed graphs, programming theory, ordered binary-decision diagrams, variable ordering
42Rakesh K. Sinha, Jayram S. Thathachar Efficient Oblivious Branching Programs for Threshold Functions Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF oblivious branching programs, rectifier-switching network, upper bound, branching programs, threshold functions, threshold function
42Anbulagan, John Thornton 0001, Abdul Sattar 0001 Dynamic Variable Filtering for Hard Random 3-SAT Problems. Search on Bibsonomy Australian Conference on Artificial Intelligence The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Search, Constraints, Problem Solving
41Kailash Jha Reconstruction of Branching Surface and Its Smoothness by Reversible Catmull-Clark Subdivision. Search on Bibsonomy ICCS (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF branching surface, incompatible curves, reconstruction, Catmull-Clark subdivision
41Kristoffer Arnsfelt Hansen Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. Search on Bibsonomy CCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Constant Width, Circuits, Planarity, Branching Programs
41Yannis Argyropoulos, Kostas Stergiou 0001 A Study of SAT-Based Branching Heuristics for the CSP. Search on Bibsonomy SETN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Branching Heuristics, CSP, SAT
41Farid M. Ablayev The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. Search on Bibsonomy SAGA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF quantum computations, Branching programs, communication computations
41Bernard Berthomieu, François Vernadat 0001 State Class Constructions for Branching Analysis of Time Petri Nets. Search on Bibsonomy TACAS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF state classes, branching time temporal properties, real-time systems modeling and verification, model-checking, bisimulation, Time Petri nets
41Alexander Bolotov, Clare Dixon Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule. Search on Bibsonomy TIME The full citation details ... 2000 DBLP  DOI  BibTeX  RDF loop detection algorithm, temporal logics, resolution, automated deduction, branching-time
41Alexander Bolotov, Michael Fisher 0001 A Resolution Method For CTL Branching-Time Temporal Logic. Search on Bibsonomy TIME The full citation details ... 1997 DBLP  DOI  BibTeX  RDF resolution method, CTL branching-time temporal logic, clausal resolution method, extended CTL, fairness operators, step resolution, temporal resolution rule, linear-time temporal resolution, temporal logic, completeness, normal form, linear temporal logic, computation tree logic, CTL*
41Rocco De Nicola, Frits W. Vaandrager Three Logics for Branching Bisimulation. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hennessy-Milner logic, backward modalities, branching bisimulation equivalence, doubly labeled transition systems, stuttering equivalence, until operations, semantics, concurrency, reactive systems, labeled transition systems, Kripke structures, CTL*
40Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov On Two Techniques of Combining Branching and Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms
40Tobias Achterberg, Timo Berthold Hybrid Branching. Search on Bibsonomy CPAIOR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
40Ján Manuch, Murray Patterson, Arvind Gupta On the Generalised Character Compatibility Problem for Non-branching Character Trees. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
40Patrick Peschlow, Peter Martini, Jason Liu 0001 Interval Branching. Search on Bibsonomy PADS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Gregory Z. Gutin, Igor Razgon, Eun Jung Kim 0002 Minimum Leaf Out-Branching Problems. Search on Bibsonomy AAIM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Sumit Nain, Moshe Y. Vardi Branching vs. Linear Time: Semantical Perspective. Search on Bibsonomy ATVA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Orna Kupferman, Moshe Y. Vardi Memoryful Branching-Time Logic. Search on Bibsonomy LICS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Elizaveta A. Okol'nishnikova On Some Bounds on the Size of Branching Programs (A Survey). Search on Bibsonomy SAGA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Marco Ragni, Stefan Wölfl 0001 Branching Allen. Search on Bibsonomy Spatial Cognition The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Panagiotis Manolios A Compositional Theory of Refinement for Branching Time. Search on Bibsonomy CHARME The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
40Yonatan Fridman, Stephen M. Pizer, Stephen R. Aylward, Elizabeth Bullitt Segmenting 3D Branching Tubular Structures Using Cores. Search on Bibsonomy MICCAI (2) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
40Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth Covering indexes for branching path queries. Search on Bibsonomy SIGMOD Conference The full citation details ... 2002 DBLP  DOI  BibTeX  RDF XML
40Farid M. Ablayev Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs. Search on Bibsonomy ICALP The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
40Chuchang Liu, Mehmet A. Orgun BCTL: A Branching Clock Temporal Logic. Search on Bibsonomy TIME The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
40Farid M. Ablayev, Marek Karpinski On the Power of Randomized Branching Programs. Search on Bibsonomy ICALP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
40Didier Caucal Branching Bisimulation for Context-free Processes. Search on Bibsonomy FSTTCS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
36Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee Time-space trade-off lower bounds for randomized computation of decision problems. Search on Bibsonomy J. ACM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF element distinctness, Branching programs, quadratic forms, random-access machines
36David K. Probst, Hon Fung Li Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems. Search on Bibsonomy CAV The full citation details ... 1990 DBLP  DOI  BibTeX  RDF delay-insensitive system, branching point, recurrence structure, behavior machine, behavior state, model checking, state explosion, partial-order semantics
35Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 Better Algorithms and Bounds for Directed Maximum Leaf Problems. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
35Jorge J. G. Leandro, Roberto M. Cesar, Luciano da Fontoura Costa Determining the branchings of 3D structures from respective 2D projections. Search on Bibsonomy SIBGRAPI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Hector Geffner Search and Inference in AI Planning. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen Tolerance Based Algorithms for the ATSP. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Paul Beame, Erik Vee Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. Search on Bibsonomy STOC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
35Byeong Min, Gwan Choi Verification Simulation Acceleration Using Code-Perturbation. Search on Bibsonomy J. Electron. Test. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF code-perturbation, simulation, verification, coverage, fault
35Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager Back and Forth Bisimulations. Search on Bibsonomy CONCUR The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
34Farn Wang Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment. Search on Bibsonomy HSCC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF algorithms, model-checking, experiment, timed automata, TCTL, branching bisimulation
34Maurice J. Jansen Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. Search on Bibsonomy MFCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF multilinear polynomials, algebraic branching programs, Computational complexity, lower bounds, arithmetical circuits
34Alberto Zanardo Quantification over Sets of Possible Worlds in Branching-Time Semantics. Search on Bibsonomy Stud Logica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF temporal logics, branching time
34Nikolaos C. Gabrielides, Alexandros I. Ginnis, Panagiotis D. Kaklis Constructing smooth branching surfaces from cross sections. Search on Bibsonomy Symposium on Solid and Physical Modeling The full citation details ... 2006 DBLP  DOI  BibTeX  RDF G1 surfaces, branching surfaces, design, reconstruction, skinning, trimming, hole filling, cross sections, shape preserving interpolation
34Michela Sabbadin, Alberto Zanardo Topological Aspects of Branching-Time Semantics. Search on Bibsonomy Stud Logica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Semantics, Topology, Branching-Time
34Ron van der Meyden, Ka-Shu Wong Complete Axiomatizations for Reasoning about Knowledge and Branching Time. Search on Bibsonomy Stud Logica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF perfect recall, multi-agent systems, temporal logic, modal logic, epistemic logic, synchrony, logic of knowledge, branching time
34Andrew J. Mason Elastic Constraint Branching, the Wedelin/Carmen Lagrangian Heuristic and Integer Programming for Personnel Scheduling. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Lagrangian, Wedelin, constraint branching, integer programming, rostering, personnel scheduling
34Miklós Ajtai A Non-linear Time Lower Bound for Boolean Branching Programs. Search on Bibsonomy FOCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Hankel matrix, lower bound, branching program
34Pranav Ashar, Sharad Malik Fast functional simulation using branching programs. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF compiled code simulation, cycle-based functional simulation, fast functional simulation, functional delay-independent logic simulation, levelized compiled-code, switch level functional simulation, synchronous digital systems, Boolean functions, system design, logic design, logic CAD, decision theory, circuit analysis computing, benchmark circuits, branching programs
34Jacques Resing Polling systems and multitype branching processes. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF ergodicity conditions, immigration, Polling systems, branching processes, queue length distribution
34S. A. Grishechkin Multiclass batch arrival retrial queues analyzed as branching processes with immigration. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF branching processes with immigration, queues, heavy traffic, overloaded, Retrial queues
34Wolfgang Thomas Computation tree logic and regular omega-languages. Search on Bibsonomy REX Workshop The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Büchi automata, Rabin tree automata, noncounting property, group-free monoids, computation tree logic, Branching time logic
33Jack Edmonds 0001 Branching Systems. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Bo Zhang, Wei Wang 0011, Xiaoling Wang, Aoying Zhou AB-Index: An Efficient Adaptive Index for Branching XML Queries. Search on Bibsonomy DASFAA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Matti Järvisalo, Tommi A. Junttila Limitations of Restricted Branching in Clause Learning. Search on Bibsonomy CP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Véronique Cortier, Ralf Küsters, Bogdan Warinschi A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols. Search on Bibsonomy ESORICS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng On-the-Fly Branching Bisimulation Minimization for Compositional Analysis. Search on Bibsonomy CIAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Patrick Peschlow, Peter Martini Towards an Efficient Branching Mechanism for Simultaneous Events in Distributed Simulation. Search on Bibsonomy PADS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 3306 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license